#include <bits/stdc++.h>
#define ll long long
#define pr pair<double,int>
using namespace std;
const int maxn=1e5+10;
int ans,m,n,p;
int a[maxn];
struct node
{
int l,r;
ll sum,add;//add为懒标记
} tr[4*maxn];
void pushup(int u)
{
tr[u].sum=tr[u<<1].sum+tr[u<<1|1].sum;
}
void pushdown(int u)
{
auto &root=tr[u],&left=tr[u<<1],&right=tr[u<<1|1];
if(root.add)
{
left.add+=root.add,left.sum+=(ll)(left.r-left.l+1)*root.add;
right.add+=root.add,right.sum+=(ll)(right.r-right.l+1)*root.add;
root.add=0;//根节点传递lazzy标记后取消
}
}
void build(int u,int l,int r)
{
if(l==r)
{
tr[u]= {l,l,a[l],0};
}
else
{
tr[u]= {l,r};
int mid=l+r>>1;
build(u<<1,l,mid);
build(u<<1|1,mid+1,r);
pushup(u);
}
}
void modify(int u,int l,int r,int d)
{
if(tr[u].l>=l&&tr[u].r<=r)
{
tr[u].add+=d;
tr[u].sum+=(ll)(tr[u].r-tr[u].l+1)*d;
}
else
{
int mid=tr[u].l+tr[u].r>>1;
pushdown(u); //向下修改前一定要先pushdown,不然回造成错误的累加
if(l<=mid)modify(u<<1,l,r,d);
if(r>mid)modify(u<<1|1,l,r,d);
pushup(u);
}
}
ll query(int u,int l,int r)
{
if(tr[u].l>=l&&tr[u].r<=r)
{
return tr[u].sum;
}
else
{
pushdown(u);//查询lazz标记才会扩散
int mid=tr[u].l+tr[u].r>>1;
ll sum=0;
if(l<=mid) sum=query(u<<1,l,r);
if(r>mid) sum+=query(u<<1|1,l,r);
// 查询以后即使pushdown了,也不需要pushup,因为pushdown,已经算过了子区间的sum和
return sum;
}
}
int main()
{
cin>>n>>m;
for(int i=1; i<=n; i++)
{
cin>>a[i];
}
build(1,1,n);
char op[2];
int l,r,d;
while(m--)
{
cin>>op>>l>>r;
if(*op=='C')
{
cin>>d;
modify(1,l,r,d);
}
else printf("%lld\n",query(1,l,r));
}
return 0;
}
06-13
06-04
238
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
11-21
214
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)