树状数组区间修改,区间查询

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
#define maxn 200010
#define lowbit(x) x&(-x)
#define LL long long
inline int read()
{
    int s=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')
            f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
        s=s*10+ch-'0',ch=getchar();
    return s*f;
}
int n,m;
class fenwick
{
    LL c1[maxn],c2[maxn];
    int i;
    public:
        inline void update(int x,int w)
        {
            for(i=x;i<=n;i+=lowbit(i))
            {
                c1[i]+=w;
                c2[i]+=x*w;
            }
        }
        inline LL query(int x)
        {
            LL ans=0;
            for(i=x;i>0;i-=lowbit(i))
                ans+=(x+1)*c1[i]-c2[i];
            return ans;
        }
}T;
int s[maxn];
int main()
{
    int op,l,r,w,i;
    n=read();
    for(i=1;i<=n;i++)
        s[i]=s[i-1]+read();
    m=read();
    for(i=1;i<=m;i++)
    {
        op=read();
        l=read();
        r=read();
        if(op==1)
        {
            w=read();
            T.update(l,w);
            T.update(r+1,-w);
        }
        else
            printf("%lld
",T.query(r)-T.query(l-1)+s[r]-s[l-1]);
    }
}