http://acm.nefu.edu.cn/JudgeOnline/problemShow.php?problem_id=1473
#include <iostream>
#include <cstring>
#include <cstdio>
#define maxn 100005
typedef long long ll;
using namespace std;
ll tree[4*maxn];
ll add[4*maxn];
int n,m;
void pushup(int i)
{
tree[i]=tree[i<<1]+tree[i<<1|1];
}
void pushdown(int i,int len)
{
if(add[i])
{
add[i<<1]+=add[i];
add[i<<1|1]+=add[i];
tree[i<<1]+=add[i]*(len-(len>>1));
tree[i<<1|1]+=add[i]*(len>>1);
add[i]=0;
}
}
void build(int i,int l,int r)
{
add[i]=0;
if(l==r)
{
scanf("%lld",&tree[i]);
return ;
}
int mid=(l+r)/2;
build(i<<1,l,mid);
build(i<<1|1,mid+1,r);
pushup(i);
}
void update(int i,int l,int r,int x,int y,int k)
{
if(x<=l&&y>=r)
{
tree[i]+=(r-l+1)*k;
add[i]+=k;
return ;
}
pushdown(i,r-l+1);
int mid=(l+r)/2;
if(x<=mid)update(i<<1,l,mid,x,y,k);
if(y>mid)update(i<<1|1,mid+1,r,x,y,k);
pushup(i);
}
ll query(int i,int l,int r,int x,int y)
{
if(x<=l&&y>=r)
return tree[i];
ll sum=0;
pushdown(i,r-l+1);
int mid=(l+r)/2;
if(x<=mid) sum+=query(i<<1,l,mid,x,y);
if(y>mid) sum+=query(i<<1|1,mid+1,r,x,y);
return sum;
}
int main()
{
int a,b,c;
char t;
scanf("%d%d",&n,&m);
build(1,1,n);
while(m--)
{
scanf(" %c%d%d",&t,&a,&b);//处理空格,字符
if(t=='Q')
printf("%lld\n",query(1,1,n,a,b));
else
{
scanf("%d",&c);
update(1,1,n,a,b,c);
}
}
return 0;
}