Hdu 5358 First One (尺取法+枚举)

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <iostream>
 4 #include <algorithm>
 5 using namespace std;
 6 typedef long long LL;
 7 const LL maxn = 100005;
 8 LL dp[maxn][35], arr[maxn];
 9 int main ()
10 {
11     int t, n;
12     scanf ("%d", &t);
13     while (t --)
14     {
15         scanf ("%d", &n);
16         arr[0] = 0;
17         for (int i=1; i<=n; i++)
18             scanf ("%lld", &arr[i]);
19         for (int i=0; i<35; i++)
20         {
21             LL sum = 1LL<<(i+1);
22             LL num = arr[1];
23             LL p = 1;
24             for (int j=1; j<=n; j++)
25             {
26                 num -= arr[j-1];
27                 while (num<sum && p<=n)
28                     num += arr[++p];
29                 dp[j][i] = p;//S[j,p]<2^i
30             }
31         }
32         LL ans = 0, res;
33         for (int i=1; i<=n; i++)
34         {
35             LL p = i, q;
36             for (int j=0; j<35; j++)
37             {
38                 q = dp[i][j];
39                 res = (j+1)*(i*(q-p) + (q+p-1)*(q-p)/2);
40                 ans += res;
41                 p = q;
42             }
43         }
44         printf ("%lld\n", ans);
45     }
46     return 0;
47 }