我要郁闷死啦！！！！poj 3468 A Simple Problem with Integers

线段树，每次都调试到我差点吐血，之前就放弃过了，今天重看，又是悲剧，现在才发现是long long 型数据 没有用%lld 输入，用 %d 就悲剧了这么久…… 不过，总算解决了。

不过通过无数次的修改，有点收获

poj 2777 也是区间更新，区间统计 。但是两者的方法是不同的。poj 2777上的点染色，染色不会累加，而 3468则需要每次更新都会造成点元素累加，如果只是对add成员进行操作和inherit，那长度大的线段的统计就不正确了，所以要对sum也进行动态累加和inherit

 

#include<iostream> using namespace std; struct seg_tree { int left; int right; long long sum; long long add; int calmid() { return (left+right)>>1; } int caldis() { return (right-left+1); } }; seg_tree tree[100005*3]; long long num[100005]; long long build(int idx,int left,int right) { tree[idx].left = left; tree[idx].right = right; tree[idx].add = 0; if(left == right)return tree[idx].sum = num[left]; int mid = tree[idx].calmid(); tree[idx].sum = build(idx<<1,left,mid)+build(idx<<1|1,mid+1,right); return tree[idx].sum; } void inherit(int idx) { if(tree[idx].add) { tree[idx<<1].add += tree[idx].add; tree[idx<<1|1].add += tree[idx].add; tree[idx<<1].sum += (long long )tree[idx<<1].caldis()*tree[idx].add; tree[idx<<1|1].sum += (long long )tree[idx<<1|1].caldis()*tree[idx].add; tree[idx].add = 0; } } void update(int idx,int left,int right,long long val) { if(left == tree[idx].left && right == tree[idx].right) { tree[idx].add += val; tree[idx].sum += (long long )tree[idx].caldis()*val; return; } inherit(idx); int mid = tree[idx].calmid(); if(right<=mid) update(idx<<1,left,right,val); else if(left>mid) update(idx<<1|1,left,right,val); else { update(idx<<1,left,mid,val); update(idx<<1|1,mid+1,right,val); } tree[idx].sum = tree[idx<<1].sum + tree[idx<<1|1].sum; } long long query(int idx,int left,int right) { if(left == tree[idx].left && right == tree[idx].right) return tree[idx].sum ; inherit(idx); int mid = tree[idx].calmid(); if(right<=mid) return query(idx<<1,left,right); else if(left>mid) return query(idx<<1|1,left,right); else return query(idx<<1,left,mid)+query(idx<<1|1,mid+1,right); } int main() { freopen("in.txt","r",stdin); int n,m; while(cin>>n>>m) { for(int i=1;i<=n;i++) //scanf("%d",&num[i]); //就是这个万恶的语句WA了这么久 scanf("%lld",&num[i]); build(1,1,n); for(int i=1;i<=m;i++) { char ch; cin>>ch; if('Q'==ch) { int a,b; scanf("%d%d",&a,&b); printf("%I64d/n",query(1,a,b)); } else { int a,b,c; scanf("%d%d%d",&a,&b,&c); update(1,a,b,c); } } } return 0; }