【洛谷P4513】小白逛公园（线段树+区间的合并）

题意：

维护一个有n个元素的序列，支持单点修改和查询区间最大子段和

思路：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=5e5+5;
int n,m;
ll a[maxn];
struct NODE{
	ll ans,sum,ml,mr,l,r;
}tree[maxn<<2];
void pushup(int rt){
	tree[rt].sum=tree[rt<<1].sum+tree[rt<<1|1].sum;
	tree[rt].ans=max(max(tree[rt<<1].ans,tree[rt<<1|1].ans),tree[rt<<1].mr+tree[rt<<1|1].ml);
	tree[rt].ml=max(tree[rt<<1].ml,tree[rt<<1].sum+tree[rt<<1|1].ml);
	tree[rt].mr=max(tree[rt<<1|1].mr,tree[rt<<1|1].sum+tree[rt<<1].mr);
}
void build(int rt,int l,int r){
	tree[rt].l=l,tree[rt].r=r;
	if(l==r){
		tree[rt].ml=tree[rt].mr=tree[rt].ans=tree[rt].sum=a[l];
		return;
	}
	int mid=(l+r)>>1;
	build(rt<<1,l,mid);
	build(rt<<1|1,mid+1,r);
	pushup(rt);
}
void update(int rt,int x,int val){
	if(tree[rt].l==tree[rt].r){
		tree[rt].ml=tree[rt].mr=tree[rt].ans=tree[rt].sum=val;
		return;
	}
	int mid=(tree[rt].l+tree[rt].r)>>1;
	if(x<=mid)update(rt<<1,x,val);
	else update(rt<<1|1,x,val);
	pushup(rt);
}
NODE query(int rt,int x,int y){
	if(x<=tree[rt].l&&tree[rt].r<=y)return tree[rt];
	int mid=(tree[rt].l+tree[rt].r)>>1;
	if(y<=mid)return query(rt<<1,x,y);
	else if(x>mid)return query(rt<<1|1,x,y);
	else{
		NODE t,t1=query(rt<<1,x,mid),t2=query(rt<<1|1,mid+1,y);
		t.ml=max(t1.ml,t1.sum+t2.ml);
		t.mr=max(t2.mr,t2.sum+t1.mr);
		t.sum=t1.sum+t2.sum;
		t.ans=max(max(t1.ans,t2.ans),t1.mr+t2.ml);
		return t;
	}
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);
	}
	build(1,1,n);
	while(m--){
		int op,x,y;
		scanf("%d%d%d",&op,&x,&y);
		if(op==2)update(1,x,y);
		else{
			if(x>y)swap(x,y);
			printf("%lld\n",query(1,x,y).ans);
		} 
	}
}