Poj ipv-a simple problem with integers (line segment tree: Segment update, interval summation)

A simple problem with Integers

Time limit:5000 Ms		Memory limit:131072 K
Total submissions:62228		Accepted:19058
Case time limit:2000 ms

Description

You haveNIntegers,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 numbersNAndQ. 1 ≤N,Q≤ 100000.
The second line containsNNumbers, the initial valuesA1,A2 ,...,An.-1000000000 ≤AI≤ 1000000000.
Each of the nextQLines represents an operation.
"CA B C"Means addingCTo eachAA,AA+ 1 ,...,AB.-10000 ≤C≤ 10000.
"QA B"Means querying the sumAA,AA+ 1 ,...,AB.

Output

You need to answer allQCommands 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

I feel that it is difficult to update segments. Lazy array tags are very clever. In the future, I must understand them thoroughly.

#include <cstdio>#include <iostream>#include <algorithm>#include <cstring>#include <cctype>#include <cmath>#include <cstdlib>#include <vector>#include <queue>#include <set>#include <map>#include <list>#define L long longusing namespace std;const int INF=1<<27;const int maxn=500010;L lazy[maxn],sum[maxn];void push_up(int root){sum[root]=sum[root*2]+sum[root*2+1];}void push_down(int root,int l,int r){if(lazy[root]){int m=r-l+1;lazy[root*2]+=lazy[root];lazy[root*2+1]+=lazy[root];sum[root*2]+=(m-m/2)*lazy[root];sum[root*2+1]+=(m/2)*lazy[root];lazy[root]=0;}}void update(int root,int l,int r,int ql,int qr,L v){if(ql>r||qr<l) return ;if(ql<=l&&qr>=r){lazy[root]+=v;sum[root]+=(v*(r-l+1));return ;//}int mid=(l+r)/2;    push_down(root,l,r);    update(root*2,l,mid,ql,qr,v);    update(root*2+1,mid+1,r,ql,qr,v);    push_up(root);}L query_sum(int root,int l,int r,int ql,int qr){if(ql>r||qr<l) return 0;if(ql<=l&&qr>=r) return sum[root];push_down(root,l,r);int mid=(l+r)/2;return query_sum(root*2,l,mid,ql,qr)+query_sum(root*2+1,mid+1,r,ql,qr);}int main(){    int n,Q,i,ql,qr;L v;char op;    scanf("%d%d",&n,&Q);  //memset(lazy,0,sizeof(lazy));  //memset(sum,0,sizeof(sum));  for(i=1;i<=n;i++){scanf("%lld",&v);update(1,1,n,i,i,v);}while(Q--){getchar();scanf("%c",&op);if(op=='Q'){scanf("%d%d",&ql,&qr);printf("%lld\n",query_sum(1,1,n,ql,qr));}else{scanf("%d%d%lld",&ql,&qr,&v);    update(1,1,n,ql,qr,v);}}  return 0;}