poj 3468线段树区间add区间查询

http://poj.org/problem?id=3468

//#include<bits/stdc++.h>
#include<cstdio>
using namespace std;
typedef long long ll;
const int maxn=111111;
struct Tree
{
    ll add,sum;
    int left,right;
};
Tree tree[maxn];
ll a[maxn<<2];
void pushup(int rt)
{
    tree[rt].sum=tree[rt*2].sum+tree[rt*2+1].sum;
}
void pushdown(int rt)
{
    if(tree[rt].add)
    {
        tree[rt*2].add+=tree[rt].add;
        tree[rt*2+1].add+=tree[rt].add;
        int sum1=tree[rt].right-tree[rt].left+1;
        tree[rt*2].sum+=((sum1+1)/2)*tree[rt].add;
        tree[rt*2+1].sum+=(sum1-(sum1+1)/2)*tree[rt].add;
        tree[rt].add=0;
    }
}
void build(int id,int l,int r)
{
    tree[id].left=l;
    tree[id].right=r;
    tree[id].add=0;
    if(l==r)
    {
        tree[id].sum=a[l];
        return;
    }
    else
    {
        int mid=(l+r)/2;
        build(id*2,l,mid);
        build(id*2+1,mid+1,r);
        pushup(id);
    }
}
void update(int id,int l,int r,int c)
{
    if(tree[id].left>=l&&tree[id].right<=r)
    {
        tree[id].add+=c;
        tree[id].sum+=(ll)c*(tree[id].right-tree[id].left+1);
        return;
    }
    pushdown(id);
    int mid=(tree[id].left+tree[id].right)/2;
    if(r<=mid)
        update(id*2,l,r,c);
    else if(l>mid)
        update(id*2+1,l,r,c);
    else
    {
        update(id*2,l,mid,c);
        update(id*2+1,mid+1,r,c);
    }
    pushup(id);
}
ll query(int id,int l,int r)
{
    if(tree[id].left>=l&&tree[id].right<=r)
        return tree[id].sum;
    pushdown(id);
    int mid=(tree[id].left+tree[id].right)/2;
    if(r<=mid)
        return query(id*2,l,r);//printf("111\n");
    else if(l>mid)
        return query(id*2+1,l,r);
    else
        return query(id*2,l,mid)+ query(id*2+1,mid+1,r);
}
int main()
{
    int m,n;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        scanf("%lld",&a[i]);
    build(1,1,n);
    while(m--)
    {
        char s[5];
        int a,b,c;
        scanf("%s",s);
        if(s[0]=='Q')
        {
            scanf("%d%d",&a,&b);


            printf("%lld\n",query(1,a,b));
        }
        else
        {
            scanf("%d%d%d",&a,&b,&c);
            update(1,a,b,c);
        }
    }
}