完整性有待验证,自己用。
未封装版:
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define inf 0x3f3f3f
struct node
{
node* ch[2];
int va,num,s;
int ran;
int cmp(int x)
{
if(x==va) return -1;
return (x<va?0:1);
}
};
node *root;///treap的根
void pushup(node* o)
{
if(!o) return;
o->s=o->num;
if(o->ch[0]) o->s+=o->ch[0]->s;
if(o->ch[1]) o->s+=o->ch[1]->s;
}
void rateto(node* &o,int d)///旋转
{
node* k;
k=o->ch[d^1];
o->ch[d^1]=k->ch[d];
k->ch[d]=o;
pushup(o);
pushup(k);
o=k;
}
void add(node* &o,int x)///加数
{
if(!o)
{
o=new node();
o->ch[0]=o->ch[1]=0;
o->va=x;
o->ran=rand()*rand();
o->s=1;
o->num=1;
return;
}
int d=o->cmp(x);
if(d==-1)
{
o->num++;
o->s++;
}
else
{
add(o->ch[d],x);
pushup(o);
if(o->ran < o->ch[d]->ran) rateto(o,d^1);
}
}
void Remove(node* &o,int x)///删除x这个数
{
int d1=o->cmp(x);
if(d1==-1)
{
if(o->num > 1)
{
o->num--;
o->s--;
}
else
{
node* p;
p=o;
if(!(o->ch[0]))
{
o=o->ch[1];
free(p);
}
else if(!(o->ch[1]))
{
o=o->ch[0];
free(p);
}
else
{
int d2=o->ch[0]->ran > o->ch[1]->ran ? 1:0;
rateto(o,d2);
Remove(o->ch[d2],x);
}
}
}
else Remove(o->ch[d1],x);
pushup(o);
}
int Kth(int k)///查找第k小的数
{
node* p=root;
while(1)
{
int cnt=(p->ch[0])?(p->ch[0]->s):0;
if(cnt<k&&k<=cnt+p->num)
{
return p->va;
}
else if(k<=cnt) p=p->ch[0];
else
{
k-=cnt+p->num;
p=p->ch[1];
}
if(!p) break;
}
}
int Rank(int x)///查找x的排名
{
int ans=0;
node* p=root;
while(1)
{
if(p->va==x)
{
ans+=1+(p->ch[0]?p->ch[0]->s:0);
break;
}
else if(x < p->va) p=p->ch[0];
else
{
ans+=p->num+(p->ch[0]?p->ch[0]->s:0);
p=p->ch[1];
}
}
return ans;
}
int Suc(int x)///后驱,比x大的第一个数
{
node* p=root;
int ans=0;
bool fin=0;
while(p)
{
if(p->va > x)
{
ans=p->va;
fin=1;
}
p=p->ch[p->va <= x];
}
if(fin) return ans;
return inf;
}
int Pre(int x)///前驱,比x小的第一个数
{
node* p=root;
int ans=0;
bool fin=0;
while(p)
{
if(p->va <x)
{
ans=p->va;
fin=1;
}
p=p->ch[p-> va < x];
}
if(fin) return ans;
return inf;
}
bool Find(node* o,int x)///查找是否有x这个数
{
while(o)
{
int d=o->cmp(x);
if(d==-1) return 1;
else o=o->ch[d];
}
return 0;
}
void Free(node* &o)
{
if(!o) return;
if(o->ch[0]) Free(o->ch[0]);
if(o->ch[1]) Free(o->ch[1]);
free(o);
o=0;
}
///以上只是treap的实现部分,下面是操作
int Size()
{
if(root) return root->s;
return 0;
}
void insert(int x)///在treap中插入一个x
{
add(root,x);
}
void erase(int x)///删除treap中一个x(多个只删除一个)
{
Remove(root,x);
}
int kth(int x)///返回排名为x的元素的值,x非法就返回-1
{
if(x<=0||x>Size()) return -1;
return Kth(x);
}
void clear()
{
Free(root);
}
void print(node* o)
{
if(!o) return;
if(o->ch[0])
print(o->ch[0]);
printf("%d,",o->va);
if(o->ch[1])
print(o->ch[1]);
}
int main()
{
char ss[20];
while(scanf("%s",ss)!=EOF)
{
if(strcmp(ss,"-1")==0) break;
if(ss[0]=='e')
{
puts("end of this test");
clear();
continue;
}
if(ss[0]=='p'&&ss[2]=='i')
{
print(root);
puts("end of print");
}
else
{
int x;
scanf("%d",&x);
if(ss[0]=='i')
{
if(!Find(root,x)) insert(x);
}
else if(ss[0]=='d')
{
if(Find(root,x)) erase(x);
else puts("Input Error");
}
else if(ss[0]=='p'&&ss[2]=='e')
{
if(Find(root,x))
{
int y=Pre(x);
if(y<inf) printf("The predecessor of %d is %d\n",x,y);
else printf("%d is the minimum\n",x);
}
else puts("Input Error");
}
else if(ss[0]=='s')
{
if(Find(root,x))
{
int y=Suc(x);
if(y<inf) printf("The successor of %d is %d\n",x,y);
else printf("%d is the maximum\n",x);
}
else puts("Input Error");
}
else if(ss[0]=='K')
{
int y=kth(x);
if(y==-1) puts("Input Error");
else printf("The %d_th element is %d\n",x,y);
}
else if(ss[0]=='r')
{
if(!Find(root,x)) puts("Input Error");
else printf("The rank of %d is %d_th\n",x,Rank(x));
}
}
}
return 0;
}
封装版(上决模板):
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
class multi_treap//multi_treap和treap类似,也是一种排序二叉树,但支持重复元素,其他功能上和treap一样
{
private:
struct node//multi_treap的节点定义
{
node* ch[2];
int v, r, s, num;
int cmp(int x)
{
if (x == v) return -1;
return(x < v ? 0 : 1);
}
};
node *root;//multi_treap的根
void updata(node* o)
{
if (!o) return;
o->s = o->num;
if (o->ch[0]) o->s += o->ch[0]->s;
if (o->ch[1]) o->s += o->ch[1]->s;
}
void rateto(node* &o, int d)
{
node* k;
k = o->ch[d ^ 1];
o->ch[d ^ 1] = k->ch[d];
k->ch[d] = o;
updata(o);
updata(k);
o = k;
}
void add(node* &o, int x)
{
if (!o)
{
o = new node();
o->ch[0] = o->ch[1] = 0;
o->v = x;
o->r = rand()*rand();
o->s = 1;
o->num = 1;
return;
}
int d = o->cmp(x);
if (d == -1)
{
o->num++;//multi的开关,注释掉可以关闭multi功能
o->s++;
}
else
{
add(o->ch[d], x);
updata(o);
if (o->r < o->ch[d]->r) rateto(o, d ^ 1);
}
}
void remove(node* &o, int x)
{
int d = o->cmp(x);
if (d == -1)
{
if (o->num>1)
{
o->num--;
o->s--;
}
else
{
if (!(o->ch[0]))
{
node *p = o;
o = o->ch[1];
free(p);
p = 0;
}
else if (!(o->ch[1]))
{
node *p = o;
o = o->ch[0];
free(p);
p = 0;
}
else
{
int d2 = o->ch[0]->r > o->ch[1]->r ? 1 : 0;
rateto(o, d2);
remove(o->ch[d2], x);
}
}
}
else remove(o->ch[d], x);
updata(o);
}
int Kth(int k)
{
node *p = root;
while (1)
{
int su = (p->ch[0] ? p->ch[0]->s : 0);
if (su + 1 <= k&&k <= su + p->num) return p->v;
else if (k <= su) p = p->ch[0];
else
{
k -= su + p->num;
p = p->ch[1];
}
}
}
int Rank(int x)
{
int ans = 0;
node *p = root;
while (p)
{
if (p->v == x)
{
ans += 1 + (p->ch[0] ? p->ch[0]->s : 0);
return ans;
}
else
if (x < p->v) p = p->ch[0];
else
{
ans += p->num + (p->ch[0] ? p->ch[0]->s : 0);
p = p->ch[1];
}
}
return ans+1;
}
int RankPlus(int x)
{
int ans = 0;
node *p = root;
while (p)
{
if (p->v == x)
{
ans += p->num + (p->ch[0] ? p->ch[0]->s : 0);
return ans;
}
else
if (x < p->v) p = p->ch[0];
else
{
ans += p->num + (p->ch[0] ? p->ch[0]->s : 0);
p = p->ch[1];
}
}
return ans;
}
int Suc(int x)
{
node* p = root;
int ans = 0;
bool find = 0;
while (p)
{
if (p->v > x)
{
ans = p->v;
find = 1;
}
p = p->ch[p->v <= x];
}
if (find) return ans;
else return -1;
}
int Pre(int x)
{
node *p = root;
int ans = 0;
bool find = 0;
while (p)
{
if (p->v < x)
{
ans = p->v;
find = 1;
}
p = p->ch[p->v < x];
}
if (find) return ans;
else return -1;
}
bool Find(node* o, int x)
{
while (o)
{
int d = o->cmp(x);
if (d == -1) return 1;
else o = o->ch[d];
}
return 0;
}
void mymemory(node* &o)
{
if (!o) return;
if (o->ch[0]) mymemory(o->ch[0]);
if (o->ch[1]) mymemory(o->ch[1]);
free(o);
o = 0;
}
//以上是multi_treap的实现部分
public:
int size() //返回multi_treap中元素的个数
{
if (root) return root->s;
else return 0;
}
void insert(int x)//在multi_treap中插入一个x
{
add(root, x);
}
void erase(int x)//删除multi_treap中的元素x,如果multi_treap中x的有多个,则只删除一个
{
remove(root, x);
}
int kth(int x) //返回multi_treap中排名为x的元素的值,如果x非法,则返回-1
{
if (x <= 0 || x > size()) return -1;
else return Kth(x);
}
int rank(int x) //返回x在multi_treap中的排名,如果x没有在multi_treap中,则返回-1
{
return Rank(x);
}
int suc(int x) //返回multi_treap中大于x的第一个元素的值(后驱),如果x大于等于multi_treap中的最大值,则返回-1
{
return Suc(x);
}
int pre(int x) //返回multi_treap中小于x的第一个元素的值(前驱),如果x小于等于multi_treap中的最小值,则返回-1
{
return Pre(x);
}
bool find(int x) //返回x是否在该multi_treap
{
return Find(root, x);
}
void clear() //清空multi_treap
{
mymemory(root);
}
multi_treap() //multi_treap初始化
{
root = 0;
}
int rankplus(int x)
{
return RankPlus(x);
}
};