#include<cstdio>#include<cstring>#include<algorithm>#include<vector>#include<string>#include<iostream>#include<queue>#include<cmath>#include<map>#include<stack>#include<bitset>using namespace std;#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )#define CLEAR( a , x ) memset ( a , x , sizeof a )typedef long long LL;typedef pair<int,int>pil;const int INF = 0x3f3f3f3f;const int maxn=1e5+100;int lsum[maxn<<2],rsum[maxn<<2];int mm[maxn<<2],sum[maxn];int t,n,m,x;void pushup(int rs,int l,int r){lsum[rs]=lsum[rs<<1];rsum[rs]=rsum[rs<<1|1];mm[rs]=max(mm[rs<<1],mm[rs<<1|1]);int mid=(l+r)>>1;if(sum[mid]<sum[mid+1]){if(lsum[rs<<1]==mid-l+1)lsum[rs]+=lsum[rs<<1|1];if(rsum[rs<<1|1]==r-mid)rsum[rs]+=rsum[rs<<1];mm[rs]=max(mm[rs],rsum[rs<<1]+lsum[rs<<1|1]);}}void build(int rs,int l,int r){if(l==r){lsum[rs]=rsum[rs]=mm[rs]=1;return ;}int mid=(l+r)>>1;build(rs<<1,l,mid);build(rs<<1|1,mid+1,r);pushup(rs,l,r);}void update(int x,int c,int l,int r,int rs){if(l==r){sum[x]=c;return ;}int mid=(l+r)>>1;if(x<=mid) update(x,c,l,mid,rs<<1);else update(x,c,mid+1,r,rs<<1|1);pushup(rs,l,r);}int query(int x,int y,int l,int r,int rs){if(l>=x&&r<=y)return mm[rs];int mid=(l+r)>>1;int res=0;if(x<=mid) res=max(res,query(x,y,l,mid,rs<<1));if(y>mid) res=max(res,query(x,y,mid+1,r,rs<<1|1));if(sum[mid]<sum[mid+1]&&x<=mid&&y>mid)res=max(res,min(mid-x+1,rsum[rs<<1])+min(y-mid,lsum[rs<<1|1]));return res;}int main(){int x,y;char str[10];scanf("%d",&t);while(t–){CLEAR(mm,0);CLEAR(lsum,0);CLEAR(rsum,0);scanf("%d%d",&n,&m);REPF(i,1,n) scanf("%d",&sum[i]);build(1,1,n);while(m–){scanf("%s%d%d",str,&x,&y);if(str[0]=='U')update(x+1,y,1,n,1);else{int ans=query(x+1,y+1,1,n,1);printf("%d\n",ans);}}}return 0;}
，无论身处何处，只要有一颗放松而美好的心态，生活便是美好！
