GSS1 - Can you answer these queries I 题解

题目传送门

题目大意： 求区间最大子段和。

猫树裸题，直接贴代码（如果不会猫树请点这里）：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int n,m;
int a[50010];
struct node{
	int l,r,sum,sl,sr,ans;
	node *zuo,*you;
	node():l(0),r(0),sum(0),sl(0),sr(0),ans(0),zuo(NULL),you(NULL){}
	void build(int x,int y)
	{
		l=x,r=y;
		if(l<r)
		{
			int mid=x+y>>1;
			zuo=new node();zuo->build(x,mid);
			you=new node();you->build(mid+1,y);
			sum=zuo->sum+you->sum;
			sl=max(zuo->sl,zuo->sum+you->sl);
			sr=max(you->sr,you->sum+zuo->sr);
			ans=max(zuo->ans,max(you->ans,zuo->sr+you->sl));
		}
		else sum=sl=sr=ans=a[x];
	}
	node *find(int x,int y)
	{
		if(l==x&&r==y)return this;
		int mid=l+r>>1;
		if(y<=mid)return zuo->find(x,y);
		else if(x>=mid+1)return you->find(x,y);
		else
		{
			node *left=zuo->find(x,mid),*right=you->find(mid+1,y);
			node *re=new node();
			re->sum=left->sum+right->sum;
			re->sl=max(left->sl,left->sum+right->sl);
			re->sr=max(right->sr,right->sum+left->sr);
			re->ans=max(left->ans,max(right->ans,left->sr+right->sl));
			return re;
		}
	}
};
node *root=new node();

int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	scanf("%d",&a[i]);
	root->build(1,n);
	scanf("%d",&m);
	for(int i=1;i<=m;i++)
	{
		int x,y;
		scanf("%d %d",&x,&y);
		printf("%d\n",root->find(x,y)->ans);
	}
}