cogs1545 机器排序 splay

链接：http://cogs.pro/cogs/problem/problem.php?pid=1545

题意：一个机器每次只会将一个区间反转使右端点的物品正确到达左端点，求出每次转移的右端点。

维护一个splay，每次操作，把哨兵转到根，右端点后一个到达右儿子，该节点到达这个右儿子的左儿子，标记完成后再转到左子树，扔掉该节点。

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int SIZEN=100010,INF=0x7fffffff/2;
class SPLAYTREE{
public:
    class NODE{
    public:
        int key,size;
        bool rev;
        NODE *f,*lc,*rc;
        int mx;
        NODE(int k){key=mx=k;size=1;rev=0;}
    }*Nil,*Root,*left,*right;
    NODE *newNODE(int key){
        NODE *T=new NODE(key);
        T->lc=T->rc=T->f=Nil;
        return T;
    }
    void clear(){
        Nil=new NODE(INF);
        Nil->lc=Nil->rc=Nil->f=Nil;
        Nil->size=0;
        left=newNODE(INF),right=newNODE(INF);
        left->size++,left->rc=right,right->f=left;
        Root=left;
    }
    void pushdown(NODE *T){
        if(T->rev){
            T->lc->rev^=1,T->rc->rev^=1;
            swap(T->lc,T->rc);
            T->rev=0;
        }
    }
    void update(NODE *T){
        T->size=T->lc->size+T->rc->size+1;
        T->mx=min(T->lc->mx,T->rc->mx);
        T->mx=min(T->mx,T->key);
    }
    void zig(NODE *T){
        NODE *P=T->f,*rson=T->rc;
        pushdown(P->rc),pushdown(T->lc),pushdown(T->rc);
        if(Root==P) Root=T;
        else (P->f->lc==P)?(P->f->lc=T):(P->f->rc=T);
        T->f=P->f,P->f=T;rson->f=P;T->rc=P;P->lc=rson;
        update(P);
    }
    void zag(NODE *T){
        NODE *P=T->f,*lson=T->lc;
        pushdown(P->lc),pushdown(T->lc),pushdown(T->rc);
        if(Root==P) Root=T;
        else (P->f->lc==P)?(P->f->lc=T):(P->f->rc=T);
        T->f=P->f,P->f=T;lson->f=P;T->lc=P;P->rc=lson;
        update(P);
    }
    void splay(NODE *ANC,NODE *t){
        pushdown(t);
        if(t==ANC){update(t);return;}
        bool reach=false;
        while(!reach){
            NODE *P=t->f;
            if(P==ANC) (P->lc==t)?zig(t):zag(t),reach=true;
            else{
                if(P->f==ANC) reach=true;
                if(P->f->lc==P) (P->lc==t)?zig(P):zag(t),zig(t);
                else (P->rc==t)?zag(P):zig(t),zag(t);
            }
        }
        update(t);
    }
    void insert(int *a,int k){
        NODE *t=newNODE(a[1]),*p=t,*q=t;
        for(int i=2;i<=k;i++) t=newNODE(a[i]),t->f=p,p->rc=t,p=t;
        Root->rc->lc=q,q->f=Root->rc;
        splay(Root,p);
    }
    void select(NODE *ANC,int k){
        NODE *t=ANC;
        while(true){
            pushdown(t);
            if(k==t->lc->size+1){
                splay(ANC,t);
                return;
            }
            if(k<=t->lc->size) t=t->lc;
            else k-=t->lc->size+1,t=t->rc;
        }
    }
    void findmin(int k){
        NODE *t=Root;
        int pos=0;
        while(t->key!=t->mx){
            pushdown(t);
            if(t->lc->mx==t->mx) t=t->lc;
            else pos+=t->lc->size+1,t=t->rc;
        }
        pushdown(t);
        pos+=t->lc->size;
        printf("%d ",pos+k-1);
        select(Root,1);
        select(Root->rc,pos+1);
        select(Root->rc->lc,pos);
        Root->rc->lc->rev^=1;
        pushdown(Root->rc->lc);
        select(Root->rc,2);
        delete Root->rc->lc;
        Root->rc->lc=Nil;
        splay(Root,Root->rc);
    }
}tree;
int N;
pair<int,int> height[SIZEN];
int equh[SIZEN]={0};
bool work(void){
    scanf("%d",&N);
    if(!N) return false;
    for(int i=1;i<=N;i++) scanf("%d",&height[i].first),height[i].second=i;
    sort(height+1,height+1+N);
    for(int i=1;i<=N;i++) equh[height[i].second]=i;
    tree.clear();
    tree.insert(equh,N);
    for(int i=1;i<=N;i++) tree.findmin(i);
    puts("");
    return true;
}
int main(){
    freopen("roboticsort.in","r",stdin);
    freopen("roboticsort.out","w",stdout);
    while(work());
    return 0;
}