TJOI2013（BZOJ3173)最长上升子序列

传送门：http://www.lydsy.com:808/JudgeOnline/problem.php?id=3173

做法：用Splay维护数列，nlogn求出LIS，最后再整理下答案即可

Codes:

#include<set>
#include<queue>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 100010;
#define fa(i) (T[i].p)
#define L(i) (T[i].s[0])
#define R(i) (T[i].s[1])
#define Key (L(R(root)))
#define Loc(i) (T[fa(i)].s[1]==i)
#define For(i,n) for(int i=1;i<=n;i++)
#define Rep(i,l,r) for(int i=l;i<=r;i++)
#define Down(i,r,l) for(int i=r;i>=l;i--)
#define sets(a,b,c) {if(a) T[a].s[c] = b;if(b) fa(b)= a;}
struct splay{
    int size,v,s[2],p;
    void Sets(int x,int y){
        v = x; p = y; size = 1;
    }
}T[N];

struct TEMP{
    int id,ans;
}helps[N];
int root = 1,A[N],tot,Q[N],ans,Ans[N];
 
void Update(int i){
    T[i].size = T[L(i)].size + T[R(i)].size + 1;
}
 
void Rot(int x){
    int y = fa(x) , z = fa(y);
    int lx = Loc(x) , ly = Loc(y);
    sets(y,T[x].s[!lx],lx);
    sets(z,x,ly);
    sets(x,y,!lx);
    Update(y);
}
 
void Splay(int i,int goal){
    while(fa(i)!=goal){
        if(fa(fa(i))!=goal) Rot(fa(i));
        Rot(i);
    }
    Update(i);
    if(!goal) root = i;
}
 
int Rank(int kth,int i){
    if(T[L(i)].size+1==kth)      return i;
    else if(T[L(i)].size >= kth) return Rank(kth,L(i));
    else return Rank(kth-T[L(i)].size-1,R(i));
}
 
int n,pos;
void init(){
    scanf("%d",&n);
    T[root].size = 1;R(root) = 2;T[R(root)].size = 1;
    sets(root,R(root),1);Key = tot = 3;
    T[Key].size = 1;T[Key].v = 1;T[Key].p = R(root);
    Update(R(root));Update(root);scanf("%d",&pos);
    Rep(i,2,n){
        scanf("%d",&pos);pos++;
        Splay(Rank(pos,root),0);
        Splay(Rank(pos+1,root),root);
        Key=++tot;T[Key].v = i;T[Key].size = 1;T[Key].p = R(root);
        Update(R(root));Update(root);
    }
}

void Visit(int i,int rank){
    if(L(i)) Visit(L(i),rank);
    rank+=T[L(i)].size + 1;
    if(rank!=1) A[rank-1] = T[i].v;
    if(R(i)) Visit(R(i),rank);
}

bool cmp(TEMP A,TEMP B){
    return A.ans > B.ans;
}
 
int main(){
    //freopen("ans.out","w",stdout);
    init();
    Visit(root,0);
    int ans = 0;
    For(i,n){
        if(Q[ans]<A[i]) {
            Q[++ans] = A[i];Ans[i] = ans;
        }
        else{
            int L = 1 , R = ans;
            while(R-L>1){
                int Mid = (L+R)>>1;
                if(Q[Mid]>A[i]) R = Mid;
                else            L = Mid;
            }
            if(Q[L]>A[i]){
                Q[L] = A[i];Ans[i] = L;
            }
            else{
                Q[R] = A[i];Ans[i] = R;
            }
        }
    }
    For(i,n){
        helps[i].id = A[i];
        helps[i].ans = Ans[i];
    }
    sort(helps+1,helps+n+1,cmp);
    int j = 1;
    Down(i,n,1){
        while(i<helps[j].id) j++;
        Ans[i] = helps[j].ans;
    }
    For(i,n) printf("%d
",Ans[i]);
    return 0;
}