平衡树入门-Treap

平衡树就是 一颗特殊的二叉搜索树
treap 使用堆去维护 整个树的平衡
注意 平衡树的左旋和右旋操作
平衡树可以实现set 不能实现的
1 查排名
2 通过排名查数

#include <bits/stdc++.h>
using namespace std;

const int N = 2e6 + 10;
#define inf  (1<<30)
struct node {
	int l, r;
	int key, val;
	int cnt, size;
} tr[N];

int rt;
int idx;
#define ls tr[i].l
#define rs tr[i].r
void pushup(int i) {
	tr[i].size = tr[ls].size + tr[rs].size + tr[i].cnt;
}
int get(int key) {
	tr[++idx].key = key;
	tr[idx].val = rand();
	tr[idx].cnt = tr[idx].size = 1;
	return idx;
}

//右旋
void zig(int &p) {
	int q = tr[p].l;
	tr[p].l = tr[q].r;
	tr[q].r = p;
	p = q;
	pushup(tr[p].r);
	pushup(p);
}
//左旋
void zag(int &p) {
	int q = tr[p].r;
	tr[p].r = tr[q].l;
	tr[q].l = p;
	p = q;
	pushup(tr[p].l);
	pushup(p);
}
void build() {
	get(-inf);
	get(inf);
	rt = 1;
	tr[1].r = 2;
	pushup(rt);
	if(tr[1].val < tr[2].val) zag(rt);
}
void insert(int &i, int key) {
	if(!i) i = get(key);
	else if(tr[i].key == key)++tr[i].cnt;
	else if(tr[i].key > key) {
		insert(tr[i].l, key);
		if(tr[ls].val > tr[i].val)zig(i);
	} else {
		insert(tr[i].r, key);
		if(tr[rs].val > tr[i].val)zag(i);

	}
	pushup(i);
}
void remove (int &i, int key) {
	if(!i) return ;
	if(tr[i].key == key) {
		if(tr[i].cnt > 1)tr[i].cnt--;
		else if(tr[i].l || tr[i].r) {
			if(!rs || tr[ls].val > tr[rs].val) {
				zig(i);
				remove(rs, key);
			} else {
				zag(i);
				remove(ls, key);
			}
		} else i = 0;
	} else if(tr[i].key > key) remove(ls, key);
	else remove (rs, key);
	pushup(i);
}
int get_rank(int i, int key) {
	if(!i) return 0;
	if(tr[i].key == key) return tr[ls].size + 1;
	if(tr[i].key > key) return get_rank(ls, key);
	return tr[ls].size + tr[i].cnt + get_rank(rs, key);
}
int get_s(int i, int rank) {
	if(!i)return(1 << 30) ;
	if(tr[ls].size >= rank) return get_s(ls, rank);
	if(tr[ls].size + tr[i].cnt >= rank) return tr[i].key;
	return  get_s(rs, rank - tr[ls].size - tr[i].cnt);
}
int get_pre(int i, int key) {
	if(!i) return -(1 << 30);
	if(tr[i].key >= key)  return get_pre(ls, key);
	return max(tr[i].key, get_pre(rs, key));
}
int get_next(int i, int key) {
	if(!i) return (1 << 30);
	if(tr[i].key <= key) return get_next(rs, key);
	return min(tr[i].key, get_next(ls, key));
}

int n;
int main() {

	build();
	cin >> n;
	for(int i = 1; i <= n; i++) {
		int op, x;
		cin >> op>>x;
		if(op == 1) insert(rt, x);
		else if(op == 2) remove (rt, x);
		else if(op == 3) cout << (get_rank(rt, x) - 1) << endl;
		else if(op == 4) cout << get_s(rt, x + 1) << endl ;
		else if(op == 5) cout << get_pre(rt, x) << endl ;
		else  cout << get_next(rt, x) << endl;;
	}
}




/*
8
1 10
1 20
1 30
3 20
4 2
2 10
5 25
6 -1*/