分块模板

区间修改，区间求值

const int N=100010;
ll a[N],sum[N],add[N];
int L[N],R[N],pos[N];
int n,m,ds;

void modify(int l,int r,ll k)
{
    int p=pos[l],q=pos[r];
    if(p==q)
    {
        FOR(i,l,r) a[i]+=k;
        sum[p]+=(r-l+1)*k;
        return;
    }
    FOR(i,p+1,q-1) add[i]+=k;
    FOR(i,l,R[p]) a[i]+=k;
    sum[p]+=(R[p]-l+1)*k;
    FOR(i,L[q],r) a[i]+=k;
    sum[q]+=(r-L[q]+1)*k;
}

ll query(int l,int r)
{
    int p=pos[l],q=pos[r];
    ll ans=0;
    if(p==q)
    {
        FOR(i,l,r) ans+=a[i];
        ans+=add[p]*(r-l+1);
        return ans;
    }
    FOR(i,p+1,q-1)
        ans+=sum[i]+add[i]*(R[i]-L[i]+1);
    FOR(i,l,R[p]) ans+=a[i];
    ans+=(R[p]-l+1)*add[p];
    FOR(i,L[q],r) ans+=a[i];
    ans+=(r-L[q]+1)*add[q];
    return ans;
}

int main()
{
    scanf("%d%d",&n,&m);
    FOR(i,1,n) scanf("%lld",&a[i]);
    ds=sqrt(n);
    FOR(i,1,ds)
        L[i]=(i-1)*ds+1,
        R[i]=i*ds;
    if(R[ds]<n) ++ds,L[ds]=R[ds-1]+1,R[ds]=n;
    FOR(i,1,ds) FOR(j,L[i],R[i]) pos[j]=i,sum[i]+=a[j];
    int opt,l,r;ll k;
    while(m--)
    {
        scanf("%d%d%d",&opt,&l,&r);
        if(opt==1)
        {
            scanf("%lld",&k);
            modify(l,r,k);
        }
        else printf("%lld
",query(l,r));
    }
    return 0;
}