GSS3 - Can you answer these queries III 题解

题目传送门

这题也就是加了个单点修改的GSS1，依然是个大裸题，修改直接改就好了。

代码也跟GSS1的区别不大：

#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 check()
	{
		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));
	}
	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);
			check();
		}
		else sum=sl=sr=ans=a[x];
	}
	void change(int x)
	{
		if(l==r){sum=sl=sr=ans=a[x];return;}
		int mid=l+r>>1;
		if(x<=mid)zuo->change(x);
		else you->change(x);
		check();
	}
	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 id,x,y;
		scanf("%d %d %d",&id,&x,&y);
		if(id==1)printf("%d\n",root->find(x,y)->ans);
		else a[x]=y,root->change(x);
	}
}