思路:尺取法。根据数据范围可以知道⌊log2S(i,j)⌋的值可以取到[1,34],枚举每个i,用两个指针l,r将⌊logS(i,j)⌋的值相同的区间整段截取出来,再统计(i+j)的值即可得出结果。复杂度为O(34n)。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<string>
#include<algorithm>
#include<queue>
#include<vector>
#include<cmath>
#define N 1000005
#define M 1000005
#define LL long long
#define mod 1000000007
#define INF 0x3f3f3f3f
using namespace std;
int n;
int a[N];
int cur[N];
LL sum[N];
LL f[35];
void p(){
sum[0] = 0;
for (int i = 1; i <= 34; i++){
f[i] = (LL)1 << i;
}
}
void init(){
scanf("%d", &n);
for (int i = 1; i <= n; i++){
scanf("%d", &a[i]);
sum[i] = sum[i - 1] + a[i];
}
for (int i = 0; i <= n; i++)
cur[i] = i;
}
void solve(){
int l = 1, r = 1;
LL ans = 0;
for (int k = 0; k <= 34; k++){
r = cur[1];
for (int i = 1, j = 1; i <= n; i++){
l = cur[i];
r = max(cur[i], cur[i - 1]);
if (l > n)continue;
while (r <= n && sum[r] - sum[i - 1] < f[k])
r++;
if (l < r){
cur[i] = r;
if ((r - l) & 1)
ans += ((LL)(r - l)*i + (LL)(r - 1 + l) / 2 * (r - l))*max(1, k);
else
ans += ((LL)(r - l)*i + (LL)(r - 1 + l)*(r - l) / 2)*max(1, k);
}
}
}
cout << ans << endl;
}
int main(){
p();
int t;
cin >> t;
while (t--){
init();
solve();
}
return 0;
}