模板:
int a[maxn<<2],ans,lz[maxn<<2];
void build(int rt,int l,int r){
a[rt] = lz[rt] = 0;
if(l==r) return ;
int mid = (l+r)>>1;
build(rt<<1,l,mid);
build(rt<<1|1,mid+1,r);
}
void update(int rt,int l,int r,int L,int R,int x){
if(L<=l&&r<=R){
lz[rt] += x;
return ;
}
if(l!=r&&lz[rt]!=0){
lz[rt<<1] += lz[rt];
lz[rt<<1|1] += lz[rt];
lz[rt] = 0;
}
int mid = (l+r)>>1;
if(L<=mid) update(rt<<1,l,mid,L,R,x);
if(R>mid) update(rt<<1|1,mid+1,r,L,R,x);
a[rt] = max(a[rt<<1]+lz[rt<<1],a[rt<<1|1]+lz[rt<<1|1]);
}
void query(int rt,int l,int r,int L,int R){
a[rt] += lz[rt];
if(l!=r&&lz[rt]!=0){
lz[rt<<1] += lz[rt];
lz[rt<<1|1] += lz[rt];
}
lz[rt] = 0;
if(L<=l&&r<=R){
ans = max(ans,a[rt]);
return ;
}
int mid = (l+r)>>1;
if(L<=mid) query(rt<<1,l,mid,L,R);
if(R>mid) query(rt<<1|1,mid+1,r,L,R);
a[rt] = max(a[rt<<1]+lz[rt<<1],a[rt<<1|1]+lz[rt<<1|1]);
}