http://www.elijahqi.win/archives/1714
题目描述
您需要写一种数据结构(可参考题目标题),来维护一些数,其中需要提供以下操作:
插入x数
删除x数(若有多个相同的数,因只删除一个)
查询x数的排名(排名定义为比当前数小的数的个数+1。若有多个相同的数,因输出最小的排名)
查询排名为x的数
求x的前驱(前驱定义为小于x,且最大的数)
求x的后继(后继定义为大于x,且最小的数)
输入输出格式
输入格式:
第一行为n,表示操作的个数,下面n行每行有两个数opt和x,opt表示操作的序号(
1 \leq opt \leq 6
1≤opt≤6 )
输出格式:
对于操作3,4,5,6每行输出一个数,表示对应答案
输入输出样例
输入样例#1: 复制
10
1 106465
4 1
1 317721
1 460929
1 644985
1 84185
1 89851
6 81968
1 492737
5 493598
输出样例#1: 复制
106465
84185
492737
说明
时空限制:1000ms,128M
1.n的数据范围:
n \leq 100000
n≤100000
2.每个数的数据范围:
[-{10}^7, {10}^7]
[−107,107]
来源:Tyvj1728 原名:普通平衡树
在此鸣谢
splay
#include<cstdio>
#include<algorithm>
#define inf 0x3f3f3f3f
#define N 110000
using namespace std;
inline char gc(){
static char now[1<<16],*S,*T;
if (T==S) {T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9') {if (ch=='-') f=-1;ch=gc();}
while(ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=gc();}
return x*f;
}
int num[N],cnt,child[N][2],value[N],n,root,father[N],ans,size[N];
void print(int x){
if (child[x][0]) print(child[x][0]);
printf("value size father x childleft childright\n");
printf("%d %d %d %d %d %d\n",value[x],size[x],father[x],x,child[x][0],child[x][1]);
if (child[x][1]) print(child[x][1]);
}
inline void update(int x){
size[x]=size[child[x][0]]+num[x]+size[child[x][1]];
}
inline void rotate(int x,int &tar){
int y=father[x],z=father[y],l=child[y][1]==x,r=l^1;
if (y==tar) tar=x;else child[z][child[z][1]==y]=x;
father[child[x][r]]=y;father[y]=x;father[x]=z;
child[y][l]=child[x][r];child[x][r]=y;update(y);update(x);
}
inline void splay(int x,int &tar){
while(x!=tar){
int y=father[x],z=father[y];
if (y!=tar) if (child[y][0]==x^child[z][0]==y) rotate(x,tar);else rotate(y,tar);
rotate(x,tar);
}
}
inline void insert1(int x,int v){
if (value[x]==v){num[x]++;size[x]++;splay(x,root);return;}
if (v<value[x]) if (child[x][0]) insert1(child[x][0],v);else value[++cnt]=v,size[cnt]=1,num[cnt]=1,father[cnt]=x,child[x][0]=cnt,splay(cnt,root);
if (v>value[x]) if (child[x][1]) insert1(child[x][1],v);else value[++cnt]=v,size[cnt]=1,num[cnt]=1,father[cnt]=x,child[x][1]=cnt,splay(cnt,root);update(x);
}
inline int find(int x,int v){
if (value[x]==v) {splay(x,root);
return size[child[x][0]]+1;}
if (v<value[x]) return find(child[x][0],v);else return find(child[x][1],v);
}
inline int find1(int x,int pos){
int l=child[x][0];
if (size[l]+1<=pos&&pos<=size[l]+num[x]) {splay(x,root);return value[x];}
if (pos<=size[l]) return find1(l,pos);else return find1(child[x][1],pos-size[l]-num[x]);
}
inline void pre(int x,int v){
if (!x) return;
if (value[x]<v) {ans=value[x];pre(child[x][1],v);}else pre(child[x][0],v);
}
inline void pre1(int x,int v){
if (!x) return;
if (value[x]<v) {ans=x;pre1(child[x][1],v);}else pre1(child[x][0],v);
}
inline void succ(int x,int v){
if (!x) return;
if (value[x]>v){ans=value[x];succ(child[x][0],v);}else succ(child[x][1],v);
}
inline void succ1(int x,int v){
if (!x) return;
if (value[x]>v){ans=x;succ1(child[x][0],v);}else succ1(child[x][1],v);
}
inline void delete1(int x){int last,next;
pre1(root,x);last=ans;succ1(root,x);next=ans;
splay(next,root);splay(last,child[next][0]);
if (--num[child[last][1]]==0) child[last][1]=0;else splay(child[last][1],root);update(last);
}
int main(){
freopen("3369.in","r",stdin);
n=read();//value[++cnt]=-inf;value[++cnt]=inf;root=cnt;child[cnt][0]=cnt-1;father[cnt-1]=cnt;size[cnt-1]=1;size[cnt]=2;
// print(root);
insert1(root,-inf);insert1(root,inf);
for (int i=1;i<=n;++i){
int op=read();//print(root);printf("%d ",i);
if (op==1) insert1(root,read());
if (op==2) delete1(read());
if (op==3) printf("%d\n",find(root,read())-1);
if (op==4) printf("%d\n",find1(root,read()+1));
if (op==5) {pre(root,read());printf("%d\n",ans);}
if (op==6) {succ(root,read());printf("%d\n",ans);}
// printf("dsafasdf\n");
}
return 0;
}
treap
#include<cstdio>
#include<ctime>
#include<cstdlib>
struct node {
int key,fix,s1,size,left,right;
}tree[110000];
void updata(int rt){
tree[rt].size=tree[tree[rt].left].size+tree[tree[rt].right].size+tree[rt].s1;
return;
}
int ans,root,num,n;
void leftrotate(int &rt){
int tmp=tree[rt].right;
tree[rt].right=tree[tmp].left;
tree[tmp].left=rt;
tree[tmp].size=tree[rt].size;
updata(rt);
rt=tmp;
}
void rightrotate(int &rt){
int tmp=tree[rt].left;
tree[rt].left=tree[tmp].right;
tree[tmp].right=rt;
tree[tmp].size=tree[rt].size;
updata(rt);
rt=tmp;
}
void insert1(int &rt,int x){
if (rt==0){
tree[++num].key=x;tree[num].fix=rand();
tree[num].left=tree[num].right=0;
tree[num].size=tree[num].s1=1;
rt=num;
return;
}
tree[rt].size++;
if (tree[rt].key==x){
tree[rt].s1++;return;
}
if (tree[rt].key<x){
insert1(tree[rt].right,x);
if (tree[rt].fix>tree[tree[rt].right].fix) leftrotate(rt);
// updata(rt);
return;
}
insert1(tree[rt].left,x);
if (tree[rt].fix>tree[tree[rt].left].fix) rightrotate(rt);
//updata(rt);
}
void delete1(int &rt,int x){
if (rt==0) return;
if (tree[rt].key==x){
if (tree[rt].s1>1){
tree[rt].s1--;tree[rt].size--;
return;
}
if (tree[rt].left*tree[rt].right==0){
rt=tree[rt].left+tree[rt].right;
return;
}
if (tree[tree[rt].left].fix<tree[tree[rt].right].fix) leftrotate(rt);else rightrotate(rt);
delete1(rt,x);
return;
}
if (tree[rt].key>x){
--tree[rt].size;delete1(tree[rt].left,x);
}else{
--tree[rt].size;delete1(tree[rt].right,x);
}
}
int check1(int rt,int x){
if (rt==0) return 0;
if (x==tree[rt].key){
return tree[tree[rt].left].size+1;
}
if (x<tree[rt].key){
return check1(tree[rt].left,x);
}else{
return check1(tree[rt].right,x)+tree[rt].s1+tree[tree[rt].left].size;
}
}
int check2(int rt,int x){
int tmp=tree[tree[rt].left].size,tmp1=tree[rt].s1;
if (tmp<x&&x<=tmp+tmp1) return tree[rt].key;
if (x<=tmp){
return check2(tree[rt].left,x);
}else{
return check2(tree[rt].right,x-tmp-tmp1);
}
}
void pread1(int rt,int x){
if (rt==0) return;
if (x>tree[rt].key){
ans=tree[rt].key;
pread1(tree[rt].right,x);
}else pread1(tree[rt].left,x);
}
void succ1(int rt,int x){
if (rt==0) return;
if (x<tree[rt].key){
ans=tree[rt].key;
succ1(tree[rt].left,x);
}else succ1(tree[rt].right,x);
}
int main(){
//freopen("tyvj1728.in","r",stdin);
//freopen("tyvj1728.out","w",stdout);
scanf("%d",&n);
srand(time(0));
root=num=0;
//tree[num].key=tree[num].fix=tree[num].left=tree[num].right=tree[num].s1=tree[num].size=0;
for (int i=1;i<=n;++i){
int op,x;
scanf("%d%d",&op,&x);
if(op==1){
insert1(root,x);
continue;
}
if (op==2){
delete1(root,x);
continue;
}
if (op==3){
printf("%d\n",check1(root,x));continue;
}
if (op==4){
printf("%d\n",check2(root,x));continue;
}
if (op==5){
ans=0;
pread1(root,x);
printf("%d\n",ans);continue;
}
ans=0;
succ1(root,x);
printf("%d\n",ans);
}
return 0;
}