hdu 1890 Robotic SortI（splay区间旋转操作）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1890

题解：splay又一高级的功能，区间旋转这个是用线段树这些实现不了的，这题可以学习splay的旋转方法还有splay tree是按照中序来的，也就是说中序遍历后会得到原序列所以建树和线段树差不多稍微有点不一样。其实splay tree核心操作就是splay就是将某个点移到goal下面优化bst的操作。

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int M = 1e5 + ;
int pre[M] , ch[M][] , size[M] , rev[M] , tot , root;//rev类似懒惰标记表示该区间是否要旋转
void NewNode(int &r , int fa , int k) {
    r = k;
    pre[r] = fa;
    ch[r][] = ch[r][] = ;
    size[r] = ;
    rev[r] = ;
}
void Rev(int r) {
    if(!r) return ;
    else {
        swap(ch[r][] , ch[r][]);
        rev[r] ^= ;
    }
}//新的操作区间旋转
void push_up(int r) {
    size[r] = size[ch[r][]] + size[ch[r][]] + ;
}
void push_down(int r) {
    if(rev[r]) {
        Rev(ch[r][]);
        Rev(ch[r][]);
        rev[r] = ;
    }
}//新操作的push_down;
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);
    push_up(x);
}
void Splay(int r , int goal) {
    push_down(r);
    while(pre[r] != goal) {
        if(pre[pre[r]] == goal) {
            push_down(r);
            push_down(pre[r]);
            Rotate(r , ch[pre[r]][] == r);
        }
        else  {
            push_down(r);
            push_down(pre[r]);
            push_down(pre[pre[r]]);
            int y = pre[r];
            int kind = (ch[pre[y]][] == y);
            if(ch[y][kind] == y) {
                Rotate(r , !kind);
                Rotate(r , kind);
            }
            else {
                Rotate(y , kind);
                Rotate(r , kind);
            }
        }
    }
    push_up(r);
    if(goal == ) root = r;
}//有新的操作之后注意稍微修改一下旋转操作
int get_Max(int r) {
    push_down(r);
    while(ch[r][]) {
        r = ch[r][];
        push_down(r);
    }
    push_up(r);
    return r;
}
void Remove() {
    if(!ch[root][]) {
        root = ch[root][];
        pre[root] = ;
        push_up(root);
    }
    else {
        int Max_point = get_Max(ch[root][]);
        Splay(Max_point , root);
        ch[Max_point][] = ch[root][];
        pre[ch[root][]] = Max_point;
        root = Max_point;
        pre[root] = ;
        push_up(root);
    }
}//新的remove操作删除节点。
void build(int l , int r , int &x , int fa) {
    if(l > r) return ;
    int mid = (l + r) >> ;
    NewNode(x , fa , mid);
    build(l , mid -  , ch[x][] , x);
    build(mid +  , r , ch[x][] , x);
    push_up(x);
}
struct TnT {
    int pos , val;
}a[M << ];
bool cmp(TnT x , TnT y) {
    if(x.val == y.val) return x.pos < y.pos;
    return x.val < y.val;
}
int main() {
    int n;
    while(scanf("%d" , &n) , n) {
        for(int i =  ; i < n ; i++) {
            scanf("%d" , &a[i].val);
            a[i].pos = i + ;
        }
        sort(a , a + n , cmp);
        root = tot = ;
        pre[root] = ch[root][] = ch[root][] = size[root] = rev[root] = ;
        build( , n , root , );
        for(int i =  ; i < n -  ; i++) {
            Splay(a[i].pos , );
            Rev(ch[root][]);
            printf("%d " , size[ch[root][]] + i + );
            Remove();
        }
        printf("%d\n" , n);
    }
    return ;
}