[SPOJ GSS3] Can you answer these queries III [线段树]

与GSS1一样，额外添加了单点修改成某值的操作。

给定一个序列，查询区间子段和的最大值。即给x,y，求sum=a[i]+a[i+1]+...+a[j]，x<=i<=j<=y的最大的sum。还有单点修改操作。

线段树，每个节点保存从左开始的最大值，从右开始的最大值，中间的最大值，区间和。

#include <cstdio>
#include <iostream>

using namespace std;

struct Data {
	int vl,vr,v,sum;
	void set(int x) {
		vl=vr=v=sum=x;
	}
	friend Data operator + (const Data &l,const Data &r) {
		Data ans;
		ans.sum=l.sum+r.sum;
		ans.vl=max(l.vl,l.sum+r.vl);
		ans.vr=max(r.vr,r.sum+l.vr);
		ans.v=max(max(l.v,r.v),l.vr+r.vl);
		return ans;
	}
};
struct SeqNode {
	Data v;
	SeqNode *ls,*rs;
};

SeqNode b[100000];
SeqNode *bp,*root;
int a[50001];
int n;

SeqNode *maketree(int l,int r) {
	SeqNode *ans=bp++;
	if (l==r) {
		ans->v.set(a[l]);
		ans->ls=ans->rs=NULL;
	} else {
		int t=(l+r)/2;
		ans->ls=maketree(l,t);
		ans->rs=maketree(t+1,r);
		ans->v=ans->ls->v+ans->rs->v;
	}
	return ans;
}
Data get(SeqNode *from,int l,int r,int ll,int rr) {
	if (l==ll&&r==rr) return from->v;
	int t=(l+r)/2;
	if (rr<=t) return get(from->ls,l,t,ll,rr);
	else if (ll>t) return get(from->rs,t+1,r,ll,rr);
	else return get(from->ls,l,t,ll,t)+get(from->rs,t+1,r,t+1,rr);
}
void set(SeqNode *from,int l,int r,int i,int x) {
	if (l==r) from->v.set(x);
	else {
		int t=(l+r)/2;
		if (i<=t) set(from->ls,l,t,i,x);
		else set(from->rs,t+1,r,i,x);
		from->v=from->ls->v+from->rs->v;
	}
}

int main() {
	int i,m,x,y,z;
	scanf("%d",&n);
	for (i=1;i<=n;i++) scanf("%d",&a[i]);
	bp=b;
	root=maketree(1,n);
	scanf("%d",&m);
	while (m--) {
		scanf("%d%d%d",&x,&y,&z);
		if (x==0) set(root,1,n,y,z);
		else printf("%d\n",get(root,1,n,y,z).v);
	}
	return 0;
}