2021-08-05学习日记

今天模仿着写了一段treap平衡树，忙的事有点多，没来得及搞懂，明天再看

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string>
#include<string.h>

using namespace std;

const int N = 100005, INF = 0x3f3f3f3f;
int n;

struct P {
	int l, r;
	int key, val;
	int cnt, size;
}tre[N];

int root, idx;

void pushup(int p) {//更新值
	tre[p].size = tre[tre[p].l].size + tre[tre[p].r].size + tre[p].cnt;
}

int get_node(int key) {//建立节点
	tre[++idx].key = key;
	tre[idx].val = rand();
	tre[idx].cnt = tre[idx].size = 1;
	return idx;
}

void lez(int& p) {//左旋
	int q = tre[p].r;
	tre[p].r = tre[q].l; tre[q].l = p; p = q;
	pushup(tre[p].l); pushup(p);
}

void riz(int& p) {//右旋
	int q = tre[p].l;
	tre[p].l = tre[q].r; tre[q].r = p; p = q;
	pushup(tre[p].r); pushup(p);
}

void built() {
	get_node(-INF), get_node(INF);
	root = 1; tre[1].r = 2;
	pushup(root);
	if (tre[1].val < tre[2].val)lez(root);
}

void insert(int& p, int key) {
	if (!p)p = get_node(key);
	else if (key == tre[p].key)tre[p].cnt++;
	else if (key > tre[p].key) {
		insert(tre[p].r, key);
		if (tre[tre[p].r].val > tre[p].val)lez(p);
	}
	else {
		insert(tre[p].l, key);
		if (tre[tre[p].l].val > tre[p].val)riz(p);
	}
	pushup(p);
}

void remove(int& p, int key) {
	if (!p)return;
	if (tre[p].key == key) {
		if (tre[p].cnt > 1)tre[p].cnt--;
		else if (tre[p].l || tre[p].r) {
			if (!tre[p].r || tre[tre[p].l].val > tre[tre[p].r].val) {
				riz(p); remove(tre[p].r, key);
			}
			else {
				lez(p); remove(tre[p].l, key);
			}
		}
		else p = 0;
	}
	else if (tre[p].key > key) {
		remove(tre[p].l, key);
	}
	else remove(tre[p].r, key);

	pushup(p);
}

int getrk(int p, int key) {
	if (!p)return 0;
	if (tre[p].key == key)return tre[tre[p].l].size + 1;
	if (tre[p].key > key)return getrk(tre[p].l, key);
	else return tre[tre[p].l].size + tre[p].cnt + getrk(tre[p].r, key);
}

int getkr(int p, int rank) {
	if (!p)return INF;
	if (tre[tre[p].l].size >= rank)return getkr(tre[p].l, rank);
	if (tre[tre[p].l].size + tre[p].cnt >= rank)return tre[p].key;
	return getkr(tre[p].r, rank - tre[tre[p].l].size - tre[p].cnt);  
}

int minxk(int p, int key) {
	if (!p)return -INF;
	if (tre[p].key >= key)return minxk(tre[p].l, key);
	else return max(tre[p].key, minxk(tre[p].r, key));
}

int maxnk(int p, int key) {
	if (!p)return INF;
	if (tre[p].key <= key)return maxnk(tre[p].r, key);
	else return min(tre[p].key, maxnk(tre[p].l, key));
}

int main() {
	built();
	cin >> n;
	while (n--) {
		int op, x;
		cin >> op >> x;
		if (op == 1)insert(root, x);
		else if (op == 2)remove(root, x);
		else if (op == 3)cout << getrk(root, x) - 1 << endl;
		else if (op == 4)cout << getkr(root, x + 1) << endl;
		else if (op == 5)cout << minxk(root, x) << endl;
		else cout << maxnk(root, x) << endl;
	}
	return 0;
}