HDU5773-The All-purpose Zero-多校#41010-最长上升子序列问题

只想到了朴素的n^2做法，然后发现可以用splay维护。于是调了几个小时的splay。。。

splay的元素是从第二个开始的！第一个是之前插入的头节点！

 #include <cstdio>
 #include <algorithm>
 #include <cstring>

 using namespace std;

 #define Key_value ch[ch[root][1] ][0]

 const int maxn = 5e5+;
 const int INF = 0x3f3f3f3f;

 int pre[maxn],ch[maxn][],key[maxn],sz[maxn];
 int root,tot1;
 int rev[maxn],ma[maxn],add[maxn];
 int s[maxn],tot2;
 int a[maxn];
 //int n,q;

 void Treavel(int x)
 {
     if(x)
     {
         Treavel(ch[x][]);
         printf("结点:%2d: 左儿子 %2d 右儿子 %2d 父结点 %2d key=%2d size= %2d ma=%2d add=%2d\n",x,ch[x][],ch[x][],pre[x],key[x],sz[x],ma[x],add[x]);
         Treavel(ch[x][]);
     }
 }
 void debug()
 {
     printf("root:%d\n",root);
     Treavel(root);
 }
 //

 void NewNode(int &r,int father,int k)
 {
     if(tot2) r = s[tot2--];
     else r = ++tot1;
     pre[r] = father;
     ch[r][] = ch[r][] = ;
     key[r] = k;
     ma[r] = k;
     rev[r] = add[r] = ;
     sz[r] = ;
 }

 void Update_add(int r,int c)
 {
     if(!r) return ;
     key[r] += c;
     ma[r] += c;
     add[r] += c;
 }

 void Update_rev(int r)
 {
     if(!r) return ;
     swap(ch[r][],ch[r][]);
     rev[r] ^= ;
 }

 void push_up(int r)
 {
     int lson = ch[r][],rson = ch[r][];
     sz[r] = sz[lson] + sz[rson] + ;
     //ma[r] = max(max(ma[lson],ma[rson]),key[r]);
     ma[r] = max(max(ma[lson],ma[rson]),key[r]);
 }
 void update_same(int r,int c)
 {
     if(!r) return ;
     int lson = ch[r][],rson = ch[r][];
     key[r] = c;
     //ma[r] = max(max(ma[lson],ma[rson]),c);
     ma[r] = c;
 }
 void push_down(int r)
 {
     if(rev[r])
     {
         Update_rev(ch[r][]);
         Update_rev(ch[r][]);
         rev[r] = ;
     }
     if(add[r])
     {
         Update_add(ch[r][],add[r]);
         Update_add(ch[r][],add[r]);
         add[r] = ;
     }
 }

 void Build(int &x,int l,int r,int father)
 {
     if(l>r) return ;
     int mid = (l+r)>>;
     NewNode(x,father,a[mid]);
     Build(ch[x][],l,mid-,x);
     Build(ch[x][],mid+,r,x);
     push_up(x);
 }

 void Init(int x)
 {
     root = tot1 = tot2 = ;
     ch[root][] = ch[root][] = sz[root] = pre[root] = ;
     rev[root] = key[root] = ;
     ma[root] = ;
     NewNode(root,,-);
     NewNode(ch[root][],root,-);
     //for(int i=1;i<=n;i++) scanf("%d",&a[i]);
     a[] = x;
     //n = 1;
     Build(Key_value,,,ch[root][]);
     push_up(ch[root][]);
     push_up(root);
 }

 void Rotate(int x,int kind)
 {
     int y = pre[x];
     push_down(y);
     push_down(x);
     ch[y][!kind] = ch[x][kind];
     pre[ch[x][kind] ] = y;
     if(pre[y])
         ch[pre[y] ][ch[pre[y]][]==y ] = x;
     pre[x] = pre[y];
     ch[x][kind] = y;
     pre[y] = x;
     push_up(y);
 }
 void Splay(int r,int goal)
 {
     push_down(r);
     while(pre[r] != goal)
     {
         if(pre[pre[r] ] == goal)
         {
             push_down(pre[r]);
             push_down(r);
             Rotate(r,ch[pre[r]][] == r);
         }
         else
         {
             push_down(pre[pre[r] ]);
             push_down(pre[r]);
             push_down(r);
             int y = pre[r];
             int kind = ch[pre[y] ][] == y;
             if(ch[y][kind] == r)
             {
                 Rotate(r,!kind);
                 Rotate(r,kind);
             }
             else
             {
                 Rotate(y,kind);
                 Rotate(r,kind);
             }
         }
         push_up(r);
         if(goal == ) root = r;
     }
 }

 int Get_kth(int r,int k)
 {
     push_down(r);
     int t = sz[ch[r][] ] + ;
     if(t == k) return r;
     if(t > k) return Get_kth(ch[r][],k);
     else return Get_kth(ch[r][],k-t);
 }

 void Insert(int pos,int x)
 {
     //for(int i=0;i<tot;i++) scanf("%d",&a[i]);
     int tot = ;
     a[] = x;
     Splay(Get_kth(root,pos) , );
     Splay(Get_kth(root,pos+) , root);
     Build(Key_value,,tot-,ch[root][]);
     push_up(ch[root][]);
     push_up(root);
 }
 void erase(int r)
 {
     if(!r) return ;
     s[++tot2] = r;
     erase(ch[r][]);
     erase(ch[r][]);
 }
 void Delete(int pos,int tot)
 {
     Splay(Get_kth(root,pos) ,);
     Splay(Get_kth(root,pos+tot+) , root);
     erase(Key_value);
     pre[Key_value] = ;
     Key_value = ;
     push_up(ch[root][]);
     push_up(root);
 }

 void Reverse(int pos,int tot)
 {
     Splay(Get_kth(root,pos) , );
     Splay(Get_kth(root,pos+tot+), root);
     Update_rev(Key_value);
 }

 void Add(int pos,int tot,int c)
 {
     Splay(Get_kth(root,pos) , );
     Splay(Get_kth(root,pos+tot+) , root);
     Update_add(Key_value,c);
     push_up(ch[root][]);
     push_up(root);
 }
 void Make_same(int pos,int tot,int c)
 {
     Splay(Get_kth(root,pos) , );
     Splay(Get_kth(root,pos+tot+) , root);
     //printf("tihuan\n");
     //debug();
     update_same(Key_value,c);
     push_up(ch[root][]);
     push_up(root);
 }
 int Get_max(int pos,int tot)
 {
     Splay(Get_kth(root,pos) , );
     Splay(Get_kth(root,pos+tot+) , root);
     push_down(root);
     push_down(ch[root][]);
     return ma[Key_value];
 }
 int Get_final_ans(int pos,int tot,int x)
 {
     int low = pos+,high = pos+tot-;
     int mid;
     while(low <= high)
     {
         mid = (low+high)>>;
         int b = key[Get_kth(root,mid)];
         //printf("mid:%d k:%d\n",mid,b);
         if(x >= b) low = mid+;
         else high = mid -;
     }
     //printf("l:%d h:%d m:%d\n",low,high,mid);
     return (low+high)>>;
 }

 void Revolve(int l,int r,int t)
 {
     if(!t) return ;
     int c = r - t;
     Splay(Get_kth(root,l) , );
     Splay(Get_kth(root,c+),root);
     int tmp = Key_value;
     Key_value = ;
     push_up(ch[root][]);
     push_up(root);
     Splay(Get_kth(root,r-c+l) , );
     Splay(Get_kth(root,r-c+l+) , root);
     Key_value = tmp;
     pre[Key_value] = ch[root][];
     push_up(ch[root][]);
     push_up(root);
 }

 int save[maxn];
 int T,N;
 int LL,RR;
 int DP(int l,int n)
 {
     if(n==) return ;
     int i,len=,pos;
     Init(save[l]);
     //debug();
     //printf("---\n");
     for(int i=l+;i<=n;i++)
     {
         //printf("save:%d len:%d max:%d\n",save[i],len,Get_max(1,len));
         if(save[i] == )
         {
             Add(,len,);
             Insert(,);
             len++;
         }
         else if(save[i] > Get_max(,len))
         {
             //printf("max:%d\n",Get_max(1,len));
             Insert(len+,save[i]);
             len++;
         }
         else{
             pos = Get_final_ans(,len,save[i]);
             //printf("pos:%d\n",pos);
             //Add(pos,1,save[i]-key[Get_kth(root,pos)]);
             Make_same(pos,,save[i]);
         }

         //debug();
         //printf("---\n");
     }
     return len;
 }
 bool flag = false;
 void deal()
 {
     int i = ;
     while( save[i]== && i <= N) i++;
     LL = i;
     i = N;
     if(LL>=N ) {flag = true;return;}
     while(save[i] ==  && i >= ) i--;
     RR = i;
 }
 int main()
 {
     //freopen("input","r",stdin);
     //freopen("splay.out","w",stdout);
     scanf("%d",&T);
     for(int cas=;cas<=T;cas++)
     {
         scanf("%d",&N);
         for(int i=;i<=N;i++)
         {
             scanf("%d",&save[i]);
         }
         flag = false;
         deal();
         if(flag){
             printf("Case #%d: %d\n",cas,N);
             continue;
         }
         //printf("LL:%d RR:%d\n",LL,RR);
         int ans = DP(LL,RR);
         printf("Case #%d: %d\n",cas,ans+LL-+(N-RR));
     }
 }
 /*
 int m;
 int main()
 {
     while(~scanf("%d ",&n))
     {
         Init();
         //debug();
         scanf("%d ",&m);
         char op[10];
         for(int i=0;i<m;i++)
         {
             scanf(" %s",op);
             //printf("i:%d op:%s\n",i,op);
             int x,y,c,t;
             if(op[0] == 'A')            //add
             {
                 scanf("%d%d%d",&x,&y,&c);
                 Add(x,y-x+1,c);
             }
             else if(op[0] == 'I')       //insert
             {
                 scanf("%d",&x);
                 Insert(x,1);
             }
             else if(op[0] == 'D')       //delete
             {
                 scanf("%d",&x);
                 Delete(x,1);
             }
             else if(op[0] == 'M')       //min
             {
                 scanf("%d%d",&x,&y);
                 printf("%d\n",Get_min(x,y-x+1));
             }
             else if(op[0] == 'R' && op[3] == 'E')//reverse
             {
                 scanf("%d%d",&x,&y);
                 Reverse(x,y-x+1);
             }
             else                        //revolve
             {
                 scanf("%d%d%d",&x,&y,&t);
                 t = (t%(y-x+1)+(y-x+1))%(y-x+1);
                 Revolve(x,y,t);
             }
             //debug();
         }
     }
 }
 */