Hdu 3308 LCIS 线段树维护最长上升子序列

Given n integers.
You have two operations:
U A B: replace the Ath number by B. (index counting from 0)
Q A B: output the length of the longest consecutive increasing subsequence (LCIS) in [a, b].

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5,K=20;
const int maxn=N<<2;
const int maxm=N<<2;
int a[maxn],rv[maxm],lv[maxm],ans[maxn],lm[maxm],rm[maxm];
int rd(){int tt;scanf("%d",&tt);return tt;}
void up(int x,int l,int r){
    int mid=l+r>>1;
    ans[x]=max(ans[x<<1],ans[x<<1|1]);
    if(rv[x<<1]<lv[x<<1|1])ans[x]=max(ans[x],(rm[x<<1]+lm[x<<1|1]));
    lm[x]=lm[x<<1],rm[x]=rm[x<<1|1];
    if(lm[x<<1]==mid-l+1 and rv[x<<1]<lv[x<<1|1])lm[x]+=lm[x<<1|1];
    if(rm[x<<1|1]==r-mid and rv[x<<1]<lv[x<<1|1])rm[x]+=rm[x<<1];
     lv[x]=lv[x<<1];rv[x]=rv[x<<1|1];
}
void build(int x,int l,int r){
    if(l==r){lm[x]=rm[x]=ans[x]=1;rv[x]=lv[x]=rd();return ;}
    int mid=l+r>>1;
    build(x<<1,l,mid);build(x<<1|1,mid+1,r);
    up(x,l,r);
}
int ask(int x,int l,int r,int ql,int qr){
    if(ql<=l and r<=qr)return ans[x];
    int mid=l+r>>1;
    int Ans,ans1,ans2;
    ans1=ans2=Ans=0;
    if(ql<=mid)ans1=ask(x<<1,l,mid,ql,qr);
    if(qr>mid)ans2=ask(x<<1|1,mid+1,r,ql,qr);
    Ans=max(ans1,ans2);
    if(rv[x<<1]<lv[x<<1|1])Ans=max(Ans,min(mid-ql+1,rm[x<<1])+min(qr-mid,lm[x<<1|1]));
    return Ans;
}
void update(int x,int l,int r,int pos,int val){
    if(l==r){lv[x]=rv[x]=val;return ;}
    int mid=l+r>>1;
    if(pos<=mid)update(x<<1,l,mid,pos,val);
    else update(x<<1|1,mid+1,r,pos,val);
    up(x,l,r);
}
signed main(){
    #ifdef swt
    freopen("input2.txt","r",stdin);
    #endif // swt
    #define en '\n'
    int T=rd();
    while(T--){
        int n=rd();int q=rd();
        build(1,0,n-1);
        char s[10];
        while(q--){
            scanf("%s",s);
            if(s[0]=='Q'){
                int x=rd(),y=rd();
                cout<<ask(1,0,n-1,x,y)<<en;
            }else{
                int pos=rd(),val=rd();
                update(1,0,n-1,pos,val);
            }
        }
    }
}