bzoj3155 Preprefix sum 线段树

Description

---

Solution

---

只会写水题了。。

可以发现每次改a[x]就是在改[x,n]的前缀和s，那么线段树区间修改区间查询即可

Code

---

#include <stdio.h>
#include <string.h>
#include <algorithm>
#define rep(i,st,ed) for (int i=st;i<=ed;++i) 

typedef long long LL;
const int N=200005;

LL tag[N<<2],sum[N<<2],a[N];

int n,m;

int read() {
	int x=0,v=1; char ch=getchar();
	for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):(v),ch=getchar());
	for (;ch<='9'&&ch>='0';x=x*10+ch-'0',ch=getchar());
	return x*v;
}

void push_down(int now,int tl,int tr,int mid) {
	if (!tag[now]) return ;
	LL w=tag[now]; tag[now]=0;
	tag[now<<1]+=w; tag[now<<1|1]+=w;
	sum[now<<1]+=(mid-tl+1)*w;
	sum[now<<1|1]+=(tr-mid)*w;
}

void modify(int now,int tl,int tr,int l,int r,LL v) {
	if (tl==l&&tr==r) {
		sum[now]+=v*(1LL*r-1LL*l+1LL);
		tag[now]+=v;
		return ;
	}
	int mid=(tl+tr)>>1;
	push_down(now,tl,tr,mid);
	if (r<=mid) modify(now<<1,tl,mid,l,r,v);
	else if (l>mid) modify(now<<1|1,mid+1,tr,l,r,v);
	else {
		modify(now<<1,tl,mid,l,mid,v);
		modify(now<<1|1,mid+1,tr,mid+1,r,v);
	}
	sum[now]=sum[now<<1]+sum[now<<1|1];
}

LL query(int now,int tl,int tr,int l,int r) {
	if (tl==l&&tr==r) return sum[now];
	int mid=(tl+tr)>>1;
	push_down(now,tl,tr,mid);
	if (r<=mid) return query(now<<1,tl,mid,l,r);
	if (l>mid) return query(now<<1|1,mid+1,tr,l,r);
	return query(now<<1,tl,mid,l,mid)+query(now<<1|1,mid+1,tr,mid+1,r);
}

int main(void) {
	freopen("data.in","r",stdin);
	freopen("myp.out","w",stdout);
	n=read(),m=read();
	rep(i,1,n) {
		a[i]=read();
		modify(1,1,n,i,n,a[i]);
	}
	for (char opt;m--;) {
		for (opt=getchar();opt!='M'&&opt!='Q';opt=getchar()) ;
		int x=read();
		if (opt=='M') {
			LL y=read();
			modify(1,1,n,x,n,y-a[x]);
			a[x]=y;
		} else printf("%lld\n", query(1,1,n,1,x));
	}
	return 0;
}