线段树模板

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5e5+7,inf = 0x3f3f3f3f;
ll n,m,opt,l,r;
struct node{
    ll lsum,rsum,sum,Ans;
    void update(ll x){
       Ans = sum = rsum = lsum = x;
    }
}tree[maxn<<2];
node Merge(node B,node C,node A = node{0,0,0,0}){
    A.sum = B.sum+C.sum;
    A.lsum = max(B.lsum,B.sum+C.lsum);
    A.rsum = max(C.rsum,C.sum+B.rsum);
    A.Ans = max(max(B.Ans,C.Ans),B.rsum+C.lsum);
    return A;
}
void build(int L = 1,int R = n,int x = 1){
    tree[x].lsum = tree[x].rsum = 0;
    tree[x].sum = tree[x].Ans = 0;
    if(L == R){
        scanf("%lld",&tree[x].sum);
        tree[x].lsum = tree[x].rsum = tree[x].Ans = tree[x].sum;
        return;
    }
    int mid = L+R>>1;
    build(L,mid,x<<1),build(mid+1,R,x<<1|1);
    tree[x]=Merge(tree[x<<1],tree[x<<1|1]);
}
void update(int k,ll val,int L=1,int R=n,int x = 1){
    if(L == R){
        tree[x].update(val);
    }else{
        int mid = L+R>>1;
        if(k<=mid)update(k,val,L,mid,x<<1);
        else update(k,val,mid+1,R,x<<1|1);
        tree[x]=Merge(tree[x<<1],tree[x<<1|1]);
    }
}
node query(int l,int r,int L = 1,int R = n,int k = 1){
    if(l == L && R == r)return tree[k];
    int mid = L+R>>1;
    if(l>mid)return query(l,r,mid+1,R,k<<1|1);
    if(r<=mid)return query(l,r,L,mid,k<<1);
    return Merge(query(l,mid,L,mid,k<<1),query(mid+1,r,mid+1,R,k<<1|1));
}
int main(){
    scanf("%lld%lld",&n,&m);
    build();
    while(m--){
        scanf("%lld%lld%lld",&opt,&l,&r);
        if(opt == 1){
            if(l>r)swap(l,r);
            printf("%lld\n",query(l,r).Ans);
        }
        else update(l,r);
    }
    return 0;
}