hdu3308--LCIS 最大连续递增序列长度

这个是动态的，所以要用线段树维护。代码里有注释因为ls敲成lsum，rs敲成rsum查错查了好久。。

 #include <set>
 #include <map>
 #include <cmath>
 #include <ctime>
 #include <queue>
 #include <stack>
 #include <cctype>
 #include <cstdio>
 #include <string>
 #include <vector>
 #include <cstdlib>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 using namespace std;
 typedef unsigned long long ull;
 typedef long long ll;
 const int inf = 0x3f3f3f3f;
 const double eps = 1e-;
 template <class T>
 inline bool scan_d(T &ret)
 {
     char c;
     int sgn;
     if(c=getchar(),c==EOF) return ;
     while(c!='-'&&(c<''||c>''))
         c=getchar();
     sgn=(c=='-')?-:;
     ret=(c=='-')?:(c-'');
     while(c=getchar(),c>=''&&c<='')
         ret=ret*+(c-'');
     ret*=sgn;
     return ;
 }
 
 const int maxn = 1e5+;
 int ls[maxn<<],rs[maxn<<];       //ls为区间左值，rs为区间右值  比较时要用到。
 int lsum[maxn<<],rsum[maxn<<],sum[maxn<<];  //lsum为区间左上升长度，rsum为区间右上升长度，sum为区间最大上升长度。
 
 void push_up(int l,int r,int pos)
 {
     ls[pos] = ls[pos<<];
     rs[pos] = rs[pos<<|];
     lsum[pos] = lsum[pos<<];
     rsum[pos] = rsum[pos<<|];
     sum[pos] = max(sum[pos<<],sum[pos<<|]);
     int mid = (l + r) >> ;
     if (ls[pos<<|] > rs[pos<<])
     {
         sum[pos] = max(sum[pos],rsum[pos<<] + lsum[pos<<|]);
         if (lsum[pos<<] == mid - l + )               //左区间左上升长度已满
             lsum[pos] += lsum[pos<<|];
         if (rsum[pos<<|] == r - mid)                 //同理，
             rsum[pos] += rsum[pos<<];
     }
 }
 
 void build (int l,int r,int pos)
 {
     if (l == r)
     {
         int tmp;
         scanf ("%d",&tmp);
         ls[pos] = tmp;
         rs[pos] = tmp;
         lsum[pos] = rsum[pos] = sum[pos] = ;
         return;
     }
     int mid =(l + r) >> ;
     build(l,mid,pos<<);
     build(mid+,r,pos<<|);
     push_up(l,r,pos);
 }
 
 void update(int l,int r,int pos,int x,int val)
 {
     if (l == r)
     {
         ls[pos] = rs[pos] = val;
         return;
     }
     int mid = (l + r) >> ;
     if (x <= mid)
         update(l,mid,pos<<,x,val);
     else
         update(mid+,r,pos<<|,x,val);
     push_up(l,r,pos);
 }
 
 int query(int l,int r,int pos,int ua,int ub)
 {
     if (ua <= l && ub >= r)
     {
         return sum[pos];
     }
     int mid = (l + r) >> ;
     int ans1 = ,ans2 = ,ans3 = ;
     if (ua <= mid)
         ans1 = query(l,mid,pos<<,ua,ub);
     if (ub > mid)
         ans2 = query(mid+,r,pos<<|,ua,ub);
     if (ls[pos<<|] > rs[pos<<])
         ans3 = min(lsum[pos<<|],ub-mid) + min(rsum[pos<<],mid-ua+);
     return max(ans1,max(ans2,ans3));
 }
 
 int main(void)
 {
     #ifndef ONLINE_JUDGE
     freopen("in.txt","r",stdin);
     #endif
     int t;
     cin>>t;
     while (t--)
     {
         int n,q;
         scanf ("%d%d",&n,&q);
         build(,n,);
         char op[];
         int x,y;
         for (int i = ; i < q; i++)
         {
             scanf ("%s%d%d",op,&x,&y);
             if (op[] == 'Q')
                 printf("%d\n",query(,n,,x+,y+));
             if (op[] == 'U')
                 update(,n,,x+,y);
         }
     }
     return ;
 }