codevs 1082 线段树练习3 模板题

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
long long a[2000003],sum[10000003],add[10000003],n;
void pushup(long long rt){sum[rt]=sum[rt<<1]+sum[rt<<1|1];}
void build(long long l,long long r,long long rt)
{
    if (l==r){sum[rt]=a[l];return;}
    long long mid=(l+r)>>1;
    build(l,mid,rt<<1);
    build(mid+1,r,rt<<1|1);
    pushup(rt);
}
void pushdown(long long rt,long long ln,long long rn)
{
    if (add[rt])
    {
        add[rt<<1]+=add[rt];
        add[rt<<1|1]+=add[rt];
        sum[rt<<1]+=add[rt]*ln;
        sum[rt<<1|1]+=add[rt]*rn;
        add[rt]=0;
    }
}
void updata(long long L,long long R,long long C,long long l,long long r,long long rt)
{
    if ((L<=l)&&(r<=R))
    {
        sum[rt]+=C*(r-l+1);
        add[rt]+=C; return;
    }
    long long mid=(l+r)>>1;
    pushdown(rt,mid-l+1,r-mid);
    if (L<=mid) updata(L,R,C,l,mid,rt<<1);
    if (R>mid) updata(L,R,C,mid+1,r,rt<<1|1);
    pushup(rt);
}
long long query(long long L,long long R,long long l,long long r,long long rt)
{
    if ((L<=l)&&(r<=R)) return sum[rt];
    long long mid=(l+r)>>1;
    pushdown(rt,mid-l+1,r-mid);
    long long ans=0;
    if (L<=mid) ans+=query(L,R,l,mid,rt<<1);
    if (R>mid) ans+=query(L,R,mid+1,r,rt<<1|1);
    return ans;
}
int main()
{
    scanf("%lld",&n);
    long long i,j,q,t,l,r,x;
    for (i=1;i<=n;++i) scanf("%lld",&a[i]);
    build(1,n,1);
    scanf("%lld",&q);
    for (i=1;i<=q;++i)
    {
        scanf("%lld",&t);
        if (t==1)
        {
            scanf("%lld%lld%lld",&l,&r,&x);
            updata(l,r,x,1,n,1);
        }
        else
        {
            scanf("%lld%lld",&l,&r);
            printf("%lld
",query(l,r,1,n,1));
        }
    }
    return 0;
}