A Simple Problem with Integers POJ - 3468

You have N integers, A1, A2, ... , AN. 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 A1, A2, ... , AN. -1000000000 ≤ Ai ≤ 1000000000.
Each of the next Q lines represents an operation.
"C a b c" means adding c to each of Aa, Aa+1, ... , Ab. -10000 ≤ c ≤ 10000.
"Q a b" means querying the sum of Aa, Aa+1, ... , Ab.

Output

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

Sample Input

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

Sample Output

4
55
9
15

Hint

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

AC的C++程序如下:

#include<cstdio>
using namespace std;
const int MAXN=1e5+10;
typedef long long ll;
ll sum[4*MAXN],add[4*MAXN];
void push_up(int rt){ //向上更新，通过当前节点rt把值递归到父节点 
	sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}
void push_down(int rt,int m){  //更新rt的子节点 
	if(add[rt]){
		add[rt<<1]+=add[rt];
		add[rt<<1|1]+=add[rt];
		sum[rt<<1]+=(m-(m>>1))*add[rt];
		sum[rt<<1|1]+=(m>>1)*add[rt];
		add[rt]=0;
	}
}
void build(int l,int r,int rt){
	add[rt]=0;
	if(l==r){
		scanf("%lld",&sum[rt]);
		return; 
	}
	int mid=(l+r)>>1;
	build(l,mid,rt<<1);
	build(mid+1,r,rt<<1|1);
	push_up(rt);
}
void update(int a,int b,ll c,int l,int r,int rt){
	if(a<=l&&b>=r){
		sum[rt]+=(r-l+1)*c;
		add[rt]+=c;
		return;
	}
	push_down(rt,r-l+1); //向下更新 
	int mid=(l+r)>>1;
	if(a<=mid) update(a,b,c,l,mid,rt<<1);
	if(b>mid) update(a,b,c,mid+1,r,rt<<1|1);
	push_up(rt); //向上更新 
}
ll query(int a,int b,int l,int r,int rt){
	if(a<=l&&b>=r) return sum[rt];
	push_down(rt,r-l+1);
	int mid=(l+r)>>1;
	ll ans=0;
	if(a<=mid) ans+=query(a,b,l,mid,rt<<1);
	if(b>mid) ans+=query(a,b,mid+1,r,rt<<1|1);
	return ans;
}
int main(){
   int n,m;
   scanf("%d%d",&n,&m);
   build(1,n,1);
   while(m--){
   	char str[2];
   	int a,b;long long c;
   	scanf("%s",str);
   	if(str[0]=='C'){
   		scanf("%d%d%lld",&a,&b,&c);
   		update(a,b,c,1,n,1); 
	   }else{
	   	scanf("%d%d",&a,&b);
	   	printf("%lld\n",query(a,b,1,n,1));
	   }
   }
	return 0;
}