POJ3468

标签：poj3468

这个点POJ挂了，代码没法提交，先存到这里，明天再提交试试看。

//#define DEBUG
#include <stdio.h>
#define maxn 100002
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1

__int64 tree[maxn << 2], arr[maxn], lazy[maxn << 2];

void pushUp(int rt)
{
	tree[rt] = tree[rt << 1] + tree[rt << 1 | 1];
}

void pushDown(int l, int r, int rt)
{
	int mid = (l + r) >> 1;
	
	tree[rt << 1] += (mid - l + 1) * lazy[rt];
	tree[rt << 1 | 1] += (r - mid) * lazy[rt];
	
	lazy[rt << 1] = lazy[rt << 1 | 1] = lazy[rt];
	lazy[rt] = 0;
}

void build(int l, int r, int rt)
{
	lazy[rt] = 0;
	if(l == r){
		tree[rt] = arr[r]; return;
	}
	
	int mid = (l + r) >> 1;
	build(lson);
	build(rson);
	
	pushUp(rt);
}

void update(int left, int right, int val, int l, int r, int rt)
{
	if(left == l && right == r){
		lazy[rt] += val; tree[rt] += val * (r - l + 1); return;
	} //include l == r
	
	if(lazy[rt]) pushDown(l, r, rt);
	
	int mid = (l + r) >> 1;
	if(right <= mid) update(left, right, val, lson);
	else if(left > mid) update(left, right, val, rson);
	else{
		update(left, mid, val, lson);
		update(mid + 1, right, val, rson);
	}
	
	pushUp(rt);
}

__int64 query(int left, int right, int l, int r, int rt)
{
	if(lazy[rt]) pushDown(l, r, rt);
	if(left == l && right == r)
		return tree[rt];
	
	int mid = (l + r) >> 1;
	if(right <= mid){
		return query(left, right, lson);
	}else if(left > mid){
		return query(left, right, rson);
	}else{
		return query(left, mid, lson) + query(mid + 1, right, rson);
	}
}

int main()
{
	#ifdef DEBUG
	freopen("../stdin.txt", "r", stdin);
	freopen("../stdout.txt", "w", stdout);	
	#endif
	
	int n, q, i, a, b, c;
	char com[2];
	while(scanf("%d%d", &n, &q) == 2){
		for(i = 1; i <= n; ++i)
			scanf("%I64d", arr + i);
		build(1, n, 1);
		
		while(q--){
			scanf("%s%d%d", com, &a, &b);
			if(com[0] == 'C'){
				scanf("%d", &c);
				update(a, b, c, 1, n, 1);
			}else printf("%I64d\n", query(a, b, 1, n, 1));
		}
	}
	return 0;
}

POJ3468,布布扣,bubuko.com

POJ3468

标签：poj3468

原文地址：http://blog.csdn.net/chang_mu/article/details/37581635