ZOJ 2706 Thermal Death of the Universe(线段树)

普通的区间求和,延迟更新.

注意要用long long.

#include <iostream>
#include <cstdio>
#include <memory.h>
#include <cmath>
using namespace std;
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
const int maxn = 30010;

long long segs[maxn << 2], delta[maxn << 2], orisum;
int n, m;
bool f[maxn << 2];
void build(int l, int r, int rt){
	f[rt] = 0;
	delta[rt] = 0;
	if(l == r){
		scanf("%lld", &segs[rt]);
		orisum += segs[rt];
		return ;
	}
	int m = (l + r) >> 1;
	build(lson), build(rson);
	segs[rt] = segs[rt << 1] + segs[rt << 1 | 1];
}

void pushDown(int l, int r,int rt,int m){
	if(f[rt]){
		f[rt << 1] = f[rt << 1 | 1] = 1;
		delta[rt << 1] = delta[rt <<1 | 1] = delta[rt];
		segs[rt << 1] = delta[rt << 1] * (m - l + 1);
		segs[rt << 1 | 1] = delta[rt << 1 | 1] * (r - m); 
		f[rt] = 0;
		delta[rt] = 0;
	}
}
void update(long long v, int L, int R, int l, int r, int rt){
	if(L <= l && r <= R){
		f[rt] = 1;
		delta[rt] = v;
		segs[rt] = (r - l + 1) * v;
		return ;
	}
	int m = (l + r) >> 1;
	pushDown(l, r, rt, m);
	if(L <= m)update(v, L, R, lson);
	if(R > m) update(v, L, R, rson);
	segs[rt] = segs[rt << 1] + segs[rt << 1 | 1];
} 
long long query(int L, int R, int l, int r, int rt){
	if(L <= l && r <= R){
		return segs[rt];
	}
	int m = (l + r) >> 1;
	long long ret = 0;
	pushDown(l, r, rt, m);
	if(L <= m)ret += query(L, R, lson);
	if(R > m) ret += query(L, R, rson);
	segs[rt] = segs[rt << 1] + segs[rt << 1 | 1];
	return ret;
}
void printRes(int l, int r, int rt){
	if(l == r){
		if(l > 1)printf(" ");
		printf("%lld", segs[rt]);
		return ;
	}
	int m = (l + r) >> 1;
	pushDown(l, r, rt, m);
	printRes(lson), printRes(rson);
}
int main(){
	while (scanf("%d %d", &n, &m) == 2){
		orisum = 0;
		build(1, n, 1);
		while (m--){
			int l, r;
			scanf("%d %d", &l, &r);
			long long sum = query(l, r, 1, n, 1), allSum = query(1, n, 1, n,1);
			long long res = 0;
			if(allSum <= orisum){
				res = (long long)ceil(sum / (r - l + 1.0));
			}else{
				res = (long long)floor(sum / (r - l + 1.0));
			}
			update(res, l, r, 1, n, 1);
		}
		printRes(1, n, 1);
		printf("\n\n");
	}
	return 0;
}