洛谷 P3369 【模板】普通平衡树

题目链接

点此跳转

代码

范浩强版本平衡树。

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>

#define LL long long
#define mem(a, b) memset(a, b, sizeof a)
#define lowbit(x) (-x&x)
#define IOS ios::sync_with_stdio(false),cin.tie(0)
#define endl '\n'

using namespace std;

const int N = 1e5 + 10;

struct Node {
    int l, r;
    int val, key, size;
}tr[N];

int n, root, idx;

void newnode(int &x, int v) {
    x = ++ idx;
    tr[x].val = v;
    tr[x].key = rand();
    tr[x].size = 1;
}

void pushup(int u) {
    tr[u].size = tr[tr[u].l].size + tr[tr[u].r].size + 1;
}

void split(int u, int v, int &x, int &y) {
    if (!u) {
        x = y = 0;
        return;
    }

    if (tr[u].val <= v) {
        x = u;
        split(tr[u].r, v, tr[u].r, y);
        pushup(x);
    } else {
        y = u;
        split(tr[u].l, v, x, tr[u].l);
        pushup(y);
    }
}

int merge(int x, int y) {
    if (!x || !y) return x + y;
    if (tr[x].key < tr[y].key) {
        tr[x].r = merge(tr[x].r, y);
        pushup(x);
        return x;
    } else {
        tr[y].l = merge(x, tr[y].l);
        pushup(y);
        return y;
    }
}

void insert(int v) {
    int x, y, z;
    split(root, v, x, y);
    newnode(z, v);
    root = merge(merge(x, z), y);
}

void del(int v) {
    int x, y, z;
    split(root, v, x, z);
    split(x, v - 1, x, y);
    y = merge(tr[y].l, tr[y].r);
    root = merge(merge(x, y), z);
}

int getrank(int v) {
    int x, y, res;
    split(root, v - 1, x, y);
    res = tr[x].size + 1;
    root = merge(x, y);
    return res;
}

int getval(int u, int k) {
    if (tr[tr[u].l].size + 1 == k) return tr[u].val;
    else if (k <= tr[tr[u].l].size) return getval(tr[u].l, k);
    else return getval(tr[u].r, k - tr[tr[u].l].size - 1);
}

int getpre(int v) {
    int x, y, res;
    split(root, v - 1, x, y);
    res = getval(x, tr[x].size);
    root = merge(x, y);
    return res;
}

int getne(int v) {
    int x, y, res;
    split(root, v, x, y);
    res = getval(y, 1);
    root = merge(x, y);
    return res;
}

int main() {
    IOS;

    cin >> n;

    int op, x;
    for (int i = 0; i < n; i ++ ) {
        cin >> op >> x;
        if (op == 1) insert(x);
        else if (op == 2) del(x);
        else if (op == 3) cout << getrank(x) << endl;
        else if (op == 4) cout << getval(root, x) << endl;
        else if (op == 5) cout << getpre(x) << endl;
        else cout << getne(x) << endl;
    }

    return 0;
}