【YBTOJ】小白逛公园

思路：

我们对线段树每个节点维护几个信息：区间和，区间最大子段和，从左端点开始的最大和and右端点开始的，c1表示父节点，那么

c1.sum=a1.sum+b1.sum;
c1.lmax=max(a1.lmax, a1.sum+b1.lmax);
c1.rmax=max(b1.rmax, b1.sum+a1.rmax);
c1.maxx=max(a1.maxx, max(a1.rmax+b1.lmax, b1.maxx));

$code$

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>

using namespace std;

int n, m;
struct node
{
	int maxx, sum, rmax, lmax;
}a[10000100];

node add(node a1, node b1)
{
	node c1;
	c1.sum=a1.sum+b1.sum;
	c1.lmax=max(a1.lmax, a1.sum+b1.lmax);
	c1.rmax=max(b1.rmax, b1.sum+a1.rmax);
	c1.maxx=max(a1.maxx, max(a1.rmax+b1.lmax, b1.maxx));
	return c1;
}

void build(int k, int l, int r)
{
	if(l==r)
	{
		scanf("%d", &a[k].sum);
		a[k].maxx=a[k].rmax=a[k].lmax=a[k].sum;
		return;
	}
	int mid=l+r>>1;
	build(k*2, l, mid);
	build(k*2+1, mid+1, r);
	a[k]=add(a[k*2], a[k*2+1]);
}

void change(int k, int l, int r, int x, int z)
{
	if(l==r)
	{
		a[k].maxx=a[k].rmax=a[k].lmax=a[k].sum=z;
		return;
	}
	int mid=l+r>>1;
	if(x<=mid)
		change(k*2, l, mid, x, z);
	if(mid+1<=x)
		change(k*2+1, mid+1, r, x, z);
	a[k]=add(a[k*2], a[k*2+1]);
}

node query(int k, int l, int r, int x, int y)
{
	if(x<=l&&r<=y)
		return a[k];
	int mid=l+r>>1;
	if(y<=mid)
		return query(k*2, l, mid, x, y);
	if(x>mid)
		return query(k*2+1, mid+1, r, x, y);
	node a1, b1, c1;
	a1=query(k*2, l, mid, x, y);
	b1=query(k*2+1, mid+1, r, x, y);
	c1=add(a1, b1);
	return c1;
}

int main()
{
	scanf("%d%d", &n, &m);
	build(1, 1, n);
	while(m--)
	{
		int k, x, y;
		scanf("%d%d%d", &k, &x, &y);
		if(k==1)
		{
			if(x>y)
				swap(x, y);
			node ans=query(1, 1, n, x, y);
			printf("%d\n", ans.maxx);
		}
		else
			change(1, 1, n, x, y);
	}
	return 0;
}