红黑树【模板】【高性能】

#include<bits/stdc++.h>
#include<thread>
#include<windows.h>
using namespace std;
#define FIN freopen("D://debug//in.txt","r",stdin);
#define FOUT freopen("D://debug//out.txt","w",stdout);
#define FDATA freopen("D://debug//data.txt","w",stdout);
typedef long long int ll;
template<class T>
struct node{
    T v;
    node* f,*s[2];
    int sz;bool c;
    void up(){
        sz=1+s[0]->sz+s[1]->sz;
    }
    void init(T x1,node* x2,node* x3,node* x4,int x5,bool x6){
        v=x1; f=x2; s[0]=x3; s[1]=x4; sz=x5; c=x6;
    }
};
#define rb node<T> *

template<class T>
class rbtree{
public:
    rb root; rb nil; int cnt;
    node<T> nodes[100005];
    rbtree(){
        cnt=0;rb temp=&nodes[0];
        temp->f=temp->s[0]=temp->s[1]=temp; nil=root=temp;
    }
    T Findkth(int k){
        return fdk(k,root)->v;
    }
    int Valrank(T a){
        rb temp=root;
        return vrak(a,temp);
    }
    int getch(rb x){ return x->f->s[1]==x;}
    //将x过继到他的兄弟分支
    void adopt(rb x){
        swap(x->c,x->f->c);rotat(x);
    }
    //旋转
    void rotat(rb x){
        if(x->f==nil)return ;
        rb f=x->f; rb gf=f->f;
        int d1=getch(x),d2=getch(f);
        rb k=x->s[d1^1];
        if(k!=nil)k->f=f; f->s[d1]=k;
        f->f=x; x->s[d1^1]=f;
        x->f=gf;
        gf==nil? root=x : gf->s[d2]=x;
        f->up();x->up();
    }
    //寻找第k大
    rb fdk(int k,rb x){
        while(x!=nil){
            if(x->s[0]->sz+1>k)x=x->s[0];
            else if(x->s[0]->sz+1<k){
                k-=x->s[0]->sz+1;x=x->s[1];
            }
            else return x;
        }
        return x;
    }
    //寻找值排名(如果a存在则返回小于a的数量+1否则返回小于a的数量)
    int vrak(T a,rb &x){
        int ans=0;rb y=x;
        while(y!=nil){
            if(y->v>a)y=y->s[0];
            else if(y->v<a){
                ans+=y->s[0]->sz+1;y=y->s[1];
            }
            else {
                rb temp=y->s[0];
                int k=vrak(a,temp);
                ans+=temp==nil?k+1:k;
                x=temp==nil?y:temp;
                return ans;
            }
        }
        x=y;return ans;
    }
    T pre(T a){
        rb temp=root;
        int k=vrak(a,temp);
        return fdk(temp==nil?k:k-1,root)->v;
    }
    T nxt(T a){
        rb temp=root;
        int k=vrak(a+1,temp);
        return temp==nil?fdk(k+1,root)->v:a+1;
    }
};
template<class T>
class rbinsert{
public:
    rbtree<T>* tree;
    rbinsert(rbtree<T> * x){
        tree=x;
    }
    void ins(T a){
        rb x=findforins(a);
        tree->nodes[++tree->cnt].init(a,tree->nil,tree->nil,tree->nil,1,1);
        rb y=&tree->nodes[tree->cnt];
        ins(x,y);
        updatesize(x);
        insertbalance(y);
    }
    rb findforins(T a){
        rb x=tree->root; rb f=tree->nil;
        while(x!=tree->nil){
            f=x; x->v>=a? x=x->s[0] : x=x->s[1];
        }
        return f;
    }
    void ins(rb f,rb x){
        x->f=f;
        if(f==tree->nil)tree->root=x;
        else {
            f->v>=x->v? f->s[0]=x : f->s[1]=x;
        }
    }
    void updatesize(rb x){
        for( ; x!=tree->nil; x=x->f) x->up();
    }
    //插入平衡
    void insertbalance(rb x){
        while(x->f!=tree->nil&&x->f->c==1){
            rb f=x->f; rb gf=f->f; 
            bool &c=gf->s[tree->getch(f)^1]->c;
            if(c==1){
                c=0; f->c=0; gf->c=1; x=gf;
            }
            else {
                if(tree->getch(x)==tree->getch(f))tree->adopt(f);
                else {
                    tree->adopt(x); x=f;
                }
            }
        }
        if(x->f==tree->nil)x->c=0;
    }
};

template<class T>
class rbdel{
public:
    rbtree<T>* tree;
    rbdel(rbtree<T> * x){
        tree=x;
    }
    void del(T a){
        rb x=findfordel(a,tree->root);
        del(x);
    }
    void del(rb x){
        rb f=x->f;bool c=x->c;
        rb y;
        if(x->s[0]==tree->nil)transplate(x,y=x->s[1]);
        else transplate(x,y=x->s[0]);
        updatesize(f);
        //调用delblance(y)的时候，y可能是一个
        //父亲为f的nil节点，这么做比直接调用
        //delbalance(f)的平衡效果更好
        if(c==0)delblance(y);
    }
    rb findfordel(T a,rb x){
        while(x->v!=a){
            if(x->v>a)x=x->s[0];
            else if(x->v<a)x=x->s[1];
        }
        if(x->s[0]==tree->nil||x->s[1]==tree->nil)return x;
        rb y=x->s[1];
        while(y->s[0]!=tree->nil)y=y->s[0];
        x->v=y->v;
        return y;
    }
    void updatesize(rb x){
        for( ; x!=tree->nil; x=x->f) x->up();
    }
    //以x替代y
    void transplate(rb y, rb x) { 
        x->f=y->f;
        if(y->f==tree->nil)tree->root=x;
        else y->f->s[tree->getch(y)]=x;
    }
    //删除平衡
    void delblance(rb x){
        while(x->f!=tree->nil&&x->c==0){
            rb f=x->f; rb b=f->s[tree->getch(x)^1];
            if(b->c==0){
                if(b->s[0]->c+b->s[1]->c==0){
                    b->c=1; x=f;
                }
                else {
                    if(b->s[tree->getch(b)]->c==1){
                        b->s[tree->getch(b)]->c=0; tree->adopt(b); return ;
                    }
                    else tree->adopt(b->s[tree->getch(b)^1]);
                }
            }
            else tree->adopt(b);
        }
        x->c=0;
    }
};

rbtree<int> s; 
rbinsert<int> ins(&s);
rbdel<int> del(&s);
int main(){
    
#ifndef ONLINE_JUDGE
    FIN
    FOUT
#endif
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        int op,val;
        scanf("%d%d",&op,&val);
        switch(op){
            case 1:{
                ins.ins(val); break;
            }
            case 2:{
                del.del(val); break;
            }
            case 3:{
                printf("%d\n",s.Valrank(val)); break;
            }
            case 4:{
                printf("%d\n",s.Findkth(val)); break;
            }
            case 5:{
                printf("%d\n",s.pre(val)); break;
            }
            case 6:{
                printf("%d\n",s.nxt(val)); break;
            }
        }
    }
}

运行结果如图