[SPOJ GSS5] Can you answer these queries V [线段树]

与GSS1一样，但是询问操作略有不同。

给定一个序列，查询给出x1,y1,x2,y2，求sum=a[i]+a[i+1]+...+a[j]，x1<=i<=y1，x2<=j<=y2的最大的sum。题目仅保证x1<=x2，y1<=y2。

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

查询的时候注意分类讨论。

#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;

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

int n;
int a[10001];
SeqNode b[20000];
SeqNode *root,*bp;

SeqNode *maketree(int l,int r) {
	SeqNode *ans=bp++;
	if (l==r) {
		ans->ls=ans->rs=NULL;
		ans->v.set(a[l]);
	} 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) {
	//printf("-- %d %d %d %d\n",l,r,ll,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);
}

int main() {
	int t,i,m,x1,y1,x2,y2;
	scanf("%d",&t);
	while (t--) {
		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%d",&x1,&y1,&x2,&y2);
			int ans;
			if (y1+1<x2) {
				Data tmp1=get(root,1,n,x1,y1);
				Data tmp2=get(root,1,n,y1+1,x2-1);
				Data tmp3=get(root,1,n,x2,y2);
				ans=tmp1.vr+tmp2.sum+tmp3.vl;
			} else if (y1+1==x2) {
				Data tmp1=get(root,1,n,x1,y1);
				Data tmp3=get(root,1,n,x2,y2);
				ans=tmp1.vr+tmp3.vl;
			} else {
				ans=get(root,1,n,x2,y1).v;
				if (x1<x2) ans=max(ans,get(root,1,n,x1,x2-1).vr+get(root,1,n,x2,y2).vl);
				if (y1<y2) ans=max(ans,get(root,1,n,x1,y1).vr+get(root,1,n,y1+1,y2).vl);
			}
			printf("%d\n",ans);
		}
	}
	return 0;
}