hdu 5358（尺取法）

最新推荐文章于 2021-01-06 02:16:56 发布

Naruto_____

最新推荐文章于 2021-01-06 02:16:56 发布

阅读量599

点赞数

CC 4.0 BY-SA版权

分类专栏：算法文章标签：实用技巧

本文链接：https://blog.csdn.net/Naruto_____/article/details/47374163

算法专栏收录该内容

15 篇文章

订阅专栏

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define Max 100010
using namespace std;

typedef long long LL;

LL sum[Max];
LL p[50];
int n, con;

void Init() {
	for(LL i = 1; i <= 1e10; i *= 2)
		p[con++] = i;
	p[con] = 1e10 + 1;
	p[0] = 0;
}
//尺取也能这样用Orz.....mark
LL count(LL a, LL b) { //计算[a, b)的(i + j)和
	int l, r;
	l = r = 0;
	LL ans = 0;
	for(int i = 1; i <= n; i++) {
		if(l < i) l = i;
		if(r < i) r = i;
		while(l <= n && sum[l] - sum[i - 1] < a) l++;
		while(r <= n && sum[r] - sum[i - 1] < b) r++;
		r--;
		if(l == n + 1 || r == i - 1) continue;
		ans += (LL)(r - l + 1) * i + (LL)(l + r) * (r - l + 1) / 2;
	}
	return ans;
} 

int main() {
	Init();
	int t;
	scanf("%d", &t);
	while(t--) {
		scanf("%d", &n);
		for(int i = 1; i <= n; i++) {
			scanf("%lld", &sum[i]);
			sum[i] += sum[i - 1];
		}
		LL ans = 0;
		for(int i = 0; i < con; i++) {
			ans += (LL)(i + 1) * count(p[i], p[i + 1]);	
		}
		printf("%lld\n", ans);
	}
	return 0;
}