POJ A Simple Problem with Integers

A Simple Problem with Integers

Time Limit: 5000MS Memory Limit: 131072KTotal Submissions: 10026 Accepted: 2311Case Time Limit: 2000MS

Description

You have N integers, A₁, A₂, ... , A_N. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the sum of numbers in a given interval.

Input

The first line contains two numbers N and Q. 1 ≤ N,Q ≤ 100000.
The second line contains N numbers, the initial values of A₁, A₂, ... , A_N. -1000000000 ≤ A_i ≤ 1000000000.
Each of the next Q lines represents an operation.
"C a b c" means adding c to each of A_a, A_a+1, ... , A_b. -10000 ≤ c ≤ 10000.
"Q a b" means querying the sum of A_a, A_a+1, ... , A_b.

Output

You need to answer all Q commands in order. One answer in a line.

Sample Input

10 51 2 3 4 5 6 7 8 9 10Q 4 4Q 1 10Q 2 4C 3 6 3Q 2 4

Sample Output

455915

Hint

The sums may exceed the range of 32-bit integers.

 

分析：先放着。。。。。。自己先想想吧  反正是关键是那个啥。。。。

code:

 

#include<stdio.h>#define size 1000005typedef struct{__int64 d,td,htd;int l,r;}node;node tree[size*3+1];int a[size];void build(int p,int l,int r){tree[p].l=l;tree[p].r=r;tree[p].td=0;if(l>=r){tree[p].d=a[r];return;}int mid=(l+r)>>1;build(p*2,l,mid);build(p*2+1,mid+1,r);tree[p].d=tree[p*2].d+tree[p*2+1].d;}__int64 query(int p,int l,int r,__int64 s){if(tree[p].l==l&&tree[p].r==r){return tree[p].d+(r-l+1)*s;}int mid = (tree[p].l+tree[p].r)>>1;if(mid>=r){return query(p*2,l,r,s+tree[p].td);}else if(mid<l){return query(p*2+1,l,r,s+tree[p].td);}else{__int64 sum =query(p*2,l,mid,s+tree[p].td);sum+= query(p*2+1,mid+1,r,s+tree[p].td);return sum;}}void up(int p,int c){while(p!=1&&c){p/=2;tree[p].d+=c;}}void updata(int p,int l,int r,int c){if(tree[p].l==l&&tree[p].r==r){tree[p].d+=(r-l+1)*c;up( p,(r-l+1)*c);tree[p].td+=c;return;}int mid=(tree[p].l+tree[p].r)>>1;if(mid>=r){updata(p*2,l,r,c);}else if(mid<l){updata(p*2+1,l,r,c);}else{updata(p*2,l,mid,c);updata(p*2+1,mid+1,r,c);}}int main(){int n,q,x,y,i,c;char ch[2];while(scanf("%d%d",&n,&q)!=EOF){for(i=1;i<=n;i++){scanf("%d",&a[i]);}build(1,1,n);while(q--){scanf("%s",ch);if(ch[0]=='Q'){scanf("%d%d",&x,&y);printf("%I64d/n",query(1,x,y,0));}else{scanf("%d%d%d",&x,&y,&c);updata(1,x,y,c);//printf("%I64d/n",tree[3].d);}}}return 0;}