【模板】普通平衡树

#include<bits/stdc++.h>
using namespace std;
#define maxn 200005
int ch[maxn][2],val[maxn],cnt[maxn],par[maxn],siz[maxn],root;
int ncnt=0;
//index is the number of the node.
bool chk(int x)
{
    return ch[par[x]][1]==x;
}
void pushup(int x)//update the cnt value of x
{
    siz[x]=siz[ch[x][0]]+siz[ch[x][1]]+cnt[x];
}
void rotate(int x)
{
    int y=par[x],z=par[y],k=chk(x),w=ch[x][k^1];
    ch[y][k]=w;par[w]=y;
    ch[z][chk(y)]=x,par[x]=z;
    ch[x][k^1]=y;par[y]=x;
    pushup(y);pushup(x);//child first father second
}
void splay(int x,int goal=0)//let the parent of x be goal.
{
    while(par[x]!=goal)
    {
        int y=par[x],z=par[y];
        if(z!=goal)
        {
            if(chk(y)==chk(x))rotate(y);
            else rotate(x);
        }
        rotate(x);
    }
    if(!goal)root=x;//x is already the root
}
void find(int x)//return root;
{
    //if(!root)return;//the tree is empty
    int cur=root;
    while(ch[cur][x>val[cur]]&&x!=val[cur])
        cur=ch[cur][x>val[cur]];
    splay(cur);
}
void insert(int x)
{
    int cur=root,p=0;
    while(cur&&val[cur]!=x)
    {
        p=cur;//pre
        cur=ch[cur][x>val[cur]];
    }
    if(cur)cnt[cur]++;//insert calls splay,splay callx rotate,rotate calls pushup^-^
    else
    {
        cur=++ncnt;//val is sorted,while inode isn't
        if(p)ch[p][x>val[p]]=cur;
        ch[cur][0]=ch[cur][1]=0;
        val[cur]=x;par[cur]=p;
        //cout<<cur<<" "<<x<<endl;
        cnt[cur]=siz[cur]=1;
        //as long as is a new node,it is a leaf node.
    }
    splay(cur);
}
int kth(int k)
{
    int cur=root;
    while(1)
    {
        if(ch[cur][0]&&k<=siz[ch[cur][0]])
            cur=ch[cur][0];
        else if(k>siz[ch[cur][0]]+cnt[cur])
        {
            k-=siz[ch[cur][0]]+cnt[cur];
            cur=ch[cur][1];
        }
        else return cur;
    }
}
int pre(int x)//biggest element that is less than x
{
    find(x);
    if(val[root]<x)//the biggest element is still less than x
        return root;
    int cur=ch[root][0];
    while(ch[cur][1])
        cur=ch[cur][1];
    return cur;
}
int succ(int x)//smallest element that is greater than x
{
    find(x);
    if(val[root]>x)return root;//the smallest element is still greater than x
    int cur=ch[root][1];
    while(ch[cur][0])
        cur=ch[cur][0];
    return cur;
}
void remov(int x)
{
    int las=pre(x),nxt=succ(x);
    //x is the "left *tree*" of nxt,nxt is the right son of las
    splay(las);splay(nxt,las);
    int del=ch[nxt][0];
    if(cnt[del]>1)
    {
        cnt[del]--;
        splay(del);
    }
    else ch[nxt][0]=0;
}
int main()
{
    int n;
    scanf("%d",&n);
    insert(0x3f3f3f3f);
    insert(0xcfcfcfcf);
    while(n--)
    {
        int x;
        scanf("%d",&x);
        if(x==1)scanf("%d",&x),insert(x);
        else if(x==2)scanf("%d",&x),remov(x);
        else if(x==3)scanf("%d",&x),find(x),printf("%d\n",siz[ch[root][0]]);
        else if(x==4)scanf("%d",&x),printf("%d\n",val[kth(x+1)]);
        else if(x==5)scanf("%d",&x),printf("%d\n",val[pre(x)]);
        else scanf("%d",&x),printf("%d\n",val[succ(x)]);
    }
    return 0;
}