POJ 3468 A Simple Problem with Integers (线段树，区间更新)

A Simple Problem with Integers

Time Limit: 5000MS		Memory Limit: 131072K
Total Submissions: 61346		Accepted: 18734
Case 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 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.

Source

POJ Monthly--2007.11.25, Yang Yi

<pre name="code" class="cpp">#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <ctime>
#include <fstream>

#define L(x) x<<1
#define R(x) (x<<1)+1

using namespace std;
typedef long long LL;
struct node{
	int l,r;
	LL add,sum;
}t[100001*4];

LL num[100001];

void build(int l,int r,int x){
	t[x].l = l;
	t[x].r = r;
	t[x].add = 0;
	if(l == r){
		t[x].sum = num[l];		
		return ;
	}
	
	int mid = (t[x].l+t[x].r)>>1;
	build(l,mid,L(x));
	build(mid+1,r,R(x));	
	t[x].sum = t[L(x)].sum+t[R(x)].sum;
}

void update(int l,int r,int x,int c){
	if(l<=t[x].l && r>=t[x].r){
		t[x].add = t[x].add + c;
		t[x].sum += c*(t[x].r-t[x].l+1);
		return;
	}
	
	if(t[x].add){
		t[L(x)].add += t[x].add;
		t[L(x)].sum += t[x].add*(t[L(x)].r-t[L(x)].l+1);
		t[R(x)].add += t[x].add;
		t[R(x)].sum += t[x].add*(t[R(x)].r-t[R(x)].l+1);
		t[x].add = 0;
	}
	
	int mid = (t[x].l+t[x].r)>>1;
	if(l<=mid){
		update(l,r,L(x),c);
	}
	if(r>mid){
		update(l,r,R(x),c);
	}
	
	t[x].sum = t[L(x)].sum + t[R(x)].sum;
	
}

LL query(int l, int r,int x){
	if(l<=t[x].l && r>=t[x].r){
		return t[x].sum;
	}
	
		if(t[x].add){
		t[L(x)].add += t[x].add;
		t[L(x)].sum += t[x].add*(t[L(x)].r-t[L(x)].l+1);
		t[R(x)].add += t[x].add;
		t[R(x)].sum += t[x].add*(t[R(x)].r-t[R(x)].l+1);
		t[x].add = 0;
	}		

	int mid = (t[x].l+t[x].r)>>1;
	if(r<=mid){
	return query(l,r,L(x));
	}else if(l>mid){
	return query(l,r,R(x));
	}else{
		return query(l,mid,L(x))+query(mid+1,r,R(x));
	}
	
}
int main() {
	int n,q;
	
	while(scanf("%d%d",&n,&q)!=EOF){
		memset(num,0,sizeof(num));
		int i = 0;
		for(i = 1;i<=n;i++){
			scanf("%I64d",&num[i]);
		}
		build(1,n,1);
		while(q--){
			char s[10];
			scanf("%s",s);
			if(s[0] == 'Q'){
				int a,b,c;
				scanf("%d%d",&a,&b);
                printf("%I64d\n",query(a,b,1));
			}else if(s[0] == 'C'){
				int a,b,c;
				scanf("%d%d%d",&a,&b,&c);
            	update(a,b,1,c);
			}
		}
	}
	return 0;
}