POJ-3468 A Simple Problem with Integers (线段树 入门题 区间修改 区间查询)

A Simple Problem with Integers

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

#include <stdio.h>
using namespace std;
#define maxn 100001
long long c[maxn << 2], lazy[maxn << 2];
void pushdown(int o, int l, int r){
	if(l == r || lazy[o] == 0) return ;
	int mid = l + r >> 1;
	c[o << 1] += lazy[o] * (mid - l + 1);
	c[o << 1 | 1] += lazy[o] * (r - mid);
	lazy[o << 1] += lazy[o];
	lazy[o << 1 | 1] += lazy[o];
	lazy[o] = 0;
}
void build(int o, int l, int r, int id, long long x){
	if(l == r){
		c[o] = x;
		lazy[o] = 0;
		return ;
	}	
	int mid = l + r >> 1;
	if(id <= mid) build(o << 1, l, mid, id, x);
	else build(o << 1 | 1, mid + 1, r, id, x);
	c[o] = c[o << 1] + c[o << 1 | 1];
}
long long query(int o, int l, int r, int L, int R){ 
	pushdown(o, l, r); 
    if(l >= L && r <= R) return c[o];  
    int mid = l + r >> 1;
    long long ans = 0;  
    if(mid >= L) ans += query(o << 1, l, mid, L, R);  
    if(mid < R) ans += query(o << 1 | 1, mid + 1, r, L, R);  
    return ans;  
} 
void add(int o, int l, int r, int L, int R, long long x){
	pushdown(o, l, r);
	if(l >= L && r <= R){
		c[o] += x * (r - l + 1);
		lazy[o] += x;
		return;
	}
	int mid = l + r >> 1;
	if(mid >= L) add(o << 1, l, mid, L, R, x);
	if(mid < R) add(o << 1 | 1, mid + 1, r, L, R, x);
	c[o] = c[o << 1] + c[o << 1 | 1];
}
int main(){
	int n, q, x, l, r;
	scanf("%d %d", &n, &q);
	for(int i = 1; i <= n; ++i){
		scanf("%d", &x);
		build(1, 1, n, i, x);
	}
	char s[4];
	for(int i = 1; i <= q; ++i){
		scanf("%s", s);
		scanf("%d %d", &l, &r);
		if(s[0] == 'Q'){
			printf("%lld\n", query(1, 1, n, l, r));
		}
		else{
			scanf("%d", &x);
			add(1, 1, n, l, r, x);
		}
	}
}

/*
题意：
1e5的数，1e5次操作，每次要么将区间所有数增减v，要么查询区间和。

思路：
线段树区间修改区间查询，入门题。
*/