A Simple Problem with Integers （线段树模板）

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.

题意：两种操作，C：对区间[l,r]每一个数+c.   Q:查询区间[l,r]的和。

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
#define inf 0x3f3f3f3f
#define ll long long
#define N 400010
using namespace std;
ll Sum[N],add[N];
void build(int l,int r,int o)
{
    if(l==r)
    {
        scanf("%lld",&Sum[o]);
        return;
    }
    int mid=(l+r)>>1;
    build(l,mid,o<<1);
    build(mid+1,r,o<<1|1);
    Sum[o]=Sum[o<<1]+Sum[o<<1|1];
}
void pushdown(int o,int l)
{
    if(add[o])
    {
        add[o<<1]+=add[o];
        add[o<<1|1]+=add[o];
        Sum[o<<1]+=add[o]*(l-(l>>1));
        Sum[o<<1|1]+=add[o]*(l>>1);
        add[o]=0;
    }
}
void update(int x,int y,int l,int r,int o,int c)
{
    if(l>=x&&r<=y)
    {
        Sum[o]+=c*(r-l+1);
        add[o]+=c;
        return;
    }
    pushdown(o,r-l+1);
    int mid=(l+r)>>1;
    if(x<=mid)update(x,y,l,mid,o<<1,c);
    if(y>mid)update(x,y,mid+1,r,o<<1|1,c);
    Sum[o]=Sum[o<<1]+Sum[o<<1|1];
}
ll query(int x,int y,int l,int r,int o)
{
    if(l>=x&&r<=y)
        return Sum[o];
    pushdown(o,r-l+1);
    int mid=(l+r)>>1;
    ll sum=0;
    if(x<=mid)sum=query(x,y,l,mid,o<<1);
    if(y>mid)sum+=query(x,y,mid+1,r,o<<1|1);
    return sum;
}
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        memset(Sum,0,sizeof(Sum));
        memset(add,0,sizeof(add));
        build(1,n,1);
        while(m--)
        {
            char str[10];
            int l,r,c;
            scanf("%s",str);
            if(str[0]=='Q')
            {
                scanf("%d%d",&l,&r);
                printf("%lld\n",query(l,r,1,n,1));
            }
            else
            {
                scanf("%d%d%d",&l,&r,&c);
                update(l,r,1,n,1,c);
            }
        }
    }
}