BZOJ3155: Preprefix sum【线段树】

3155: Preprefix sum

emmm，没什么好说的，线段树区间加。

#include<cstdio>
using namespace std;
const int MAXN=100005;
int n,m,a[MAXN];long long Tre[MAXN<<2],Add[MAXN<<2];
#include<cctype>
int read(){
	int ret=0;char ch=getchar();bool f=1;
	for(;!isdigit(ch);ch=getchar()) f^=!(ch^'-');
	for(; isdigit(ch);ch=getchar()) ret=ret*10+ch-48;
	return f?ret:-ret;
}
void PushDown(int rt,int Ln,int Rn){
	if(!Add[rt]) return;
	Tre[rt<<1]+=Add[rt]*Ln,Add[rt<<1]+=Add[rt];
	Tre[rt<<1|1]+=Add[rt]*Rn,Add[rt<<1|1]+=Add[rt];
	Add[rt]=0;
}
void PushUp(int rt){Tre[rt]=Tre[rt<<1]+Tre[rt<<1|1];}
void Insert(int rt,int L,int R,int l,int r,int p){
	if(l<=L&&R<=r){Tre[rt]+=1ll*p*(R-L+1);Add[rt]+=p;return;}
	int mid=(R+L)>>1;PushDown(rt,mid-L+1,R-mid);
	if(l<=mid) Insert(rt<<1,L,mid,l,r,p);
	if(r>mid) Insert(rt<<1|1,mid+1,R,l,r,p);
	PushUp(rt);
}
long long Query(int rt,int L,int R,int l,int r){
	if(l<=L&&R<=r) return Tre[rt];
	int mid=(R+L)>>1;long long Ans=0;PushDown(rt,mid-L+1,R-mid);
	if(l<=mid) Ans+=Query(rt<<1,L,mid,l,r);
	if(r>mid) Ans+=Query(rt<<1|1,mid+1,R,l,r);
	return Ans;
}
int main(){
	n=read(),m=read();
	for(int i=1;i<=n;i++) a[i]=read(),Insert(1,1,n,i,n,a[i]);
	for(int i=1;i<=m;i++){
		char ch[10];scanf("%s",ch);
		if(ch[0]=='M'){
			int x=read(),y=read();
			Insert(1,1,n,x,n,-a[x]),a[x]=y;
			Insert(1,1,n,x,n,a[x]);
		}else printf("%lld\n",Query(1,1,n,1,read()));
	}
	return 0;
}