运用了函数式编程的思想。
能实现更为强大的功能
关于非旋转Treap,看这里
写得比较简洁:
#include<cstdio>
#include<cstdlib>
const int maxn=100005;
struct node{
node *s[2];
int k,f,siz;
node () {}
node (int w,node *son) {s[0]=s[1]=son;k=w;f=rand();siz=1;}
void pushup() {siz=s[0]->siz+s[1]->siz+1;}
}nil,base[maxn];
typedef node* P_node;
P_node null,len,Root;
void treap_init(){
nil=node(0,NULL);null=&nil;
null->s[0]=null->s[1]=null;
null->siz=0; len=base; Root=null;
}
P_node newnode(int x){
*len=node(x,null);
return len++;
}
P_node merge(P_node a,P_node b){
if (a==null) return b;
if (b==null) return a;
if (a->f > b->f) {a->s[1]=merge(a->s[1],b); a->pushup(); return a;}
b->s[0]=merge(a,b->s[0]); b->pushup(); return b;
}
void split(P_node x,int k,P_node &l,P_node &r){
if (x==null) {l=r=null;return;}
if (x->k <= k) {l=x;split(l->s[1],k,l->s[1],r);}else
{r=x;split(r->s[0],k,l,r->s[0]);}
x->pushup();
}
void Insert(int k){
P_node l,r;
split(Root,k,l,r);
Root=merge(merge(l,newnode(k)),r);
}
void Erase(int k){
P_node l,mid,r;
split(Root,k-1,l,r);split(r,k,mid,r);
Root=merge(l,merge(merge(mid->s[0],mid->s[1]),r));
}
int Kth(P_node x,int k){
if (k <= x->s[0]->siz) return Kth(x->s[0],k);else
if (k > x->s[0]->siz+1) return Kth(x->s[1],k - x->s[0]->siz -1);
return x->k;
}
int get_edge(P_node x,int d){
while (x->s[d]!=null) x=x->s[d];
return x->k;
}
int q;
inline int red(){
int tot=0,f=1;char ch=getchar();
while (ch<'0'||'9'<ch) {if (ch=='-') f=-f;ch=getchar();}
while ('0'<=ch&&ch<='9') tot=tot*10+ch-48,ch=getchar();
return tot*f;
}
int main(){
treap_init();
q=red();
while (q--){
int c=red();
if (c==1) Insert(red());else
if (c==2) Erase(red());else
if (c==3){
int k=red();P_node l,r;
split(Root,k-1,l,r); printf("%d\n",l->siz+1); Root=merge(l,r);
}else
if (c==4) printf("%d\n",Kth(Root,red()));else
if (c==5){
int k=red();P_node l,r;
split(Root,k-1,l,r); printf("%d\n",get_edge(l,1)); Root=merge(l,r);
}else{
int k=red();P_node l,r;
split(Root,k,l,r); printf("%d\n",get_edge(r,0)); Root=merge(l,r);
}
}
return 0;
}