二逼平衡树-线段树套无旋Treap

#include<bits/stdc++.h>
#define ls(x) arr[x].child[0]
#define rs(x) arr[x].child[1]
using namespace std;
const int maxn = 5e4 + 5;
const int maxm = 25 * maxn;
const int INF = 2147483647;
typedef long long ll;
struct node {
    int val, sz, key, child[2];
} arr[maxm];
int tot;
void Push_Up(int idx) {
    arr[idx].sz = arr[ls(idx)].sz + arr[rs(idx)].sz + 1;
}
void Split(int root, int& x, int& y, int val) {
    if(!root) {
        x = y = 0;
        return;
    }
    if(arr[root].val <= val) x = root, Split(rs(root), rs(x), y, val);
    else y = root, Split(ls(root), x, ls(y), val);
    Push_Up(root);
}
void Merge(int& root, int x, int y) {
    if(!x || !y) {
        root = x + y;
        return;
    }
    if(arr[x].key < arr[y].key) root = x, Merge(rs(root), rs(x), y);
    else root = y, Merge(ls(root), x, ls(y));
    Push_Up(root);
}
void Insert(int& root, int val) {
    int x = 0, y = 0, z = ++tot;
    arr[z].val = val, arr[z].sz = 1, arr[z].key = rand();
    Split(root, x, y, val);
    Merge(x, x, z);
    Merge(root, x, y);
}
void Erase(int& root, int val) {
    int x = 0, y = 0, z = 0;
    Split(root, x, y, val);
    Split(x, x, z, val - 1);
    Merge(z, ls(z), rs(z));
    Merge(x, x, z);
    Merge(root, x, y);
}
int Kth_number(int root, int k) {
    while(arr[ls(root)].sz + 1 != k) {
        if(arr[ls(root)].sz >= k) root = ls(root);
        else k -= arr[ls(root)].sz + 1, root = rs(root);
    }
    return arr[root].val;
}
int Get_rank(int& root, int val) {
    int x = 0, y = 0;
    Split(root, x, y, val - 1);
    int res = arr[x].sz;
    Merge(root, x, y);
    return res;
}
int Pre(int& root, int val) {
    int x = 0, y = 0;
    Split(root, x, y, val - 1);
    int res = -INF;
    if(arr[x].sz) res = Kth_number(x, arr[x].sz);
    Merge(root, x, y);
    return res;
}
int Suf(int& root, int val) {
    int x = 0, y = 0;
    Split(root, x, y, val);
    int res = INF;
    if(arr[y].sz) res = Kth_number(y, 1);
    Merge(root, x, y);
    return res;
}
int T[4 * maxn], a[maxn];
int n, m, op, l, r, x, pos;
void Add(int idx, int L, int R, int pos, int val) {
    Insert(T[idx], val);
    if(L == R) return;
    int mid = L + R >> 1;
    if(mid >= pos) Add(idx << 1, L, mid, pos, val);
    else Add(idx << 1 | 1, mid + 1, R, pos, val);
}
void Delete(int idx, int L, int R, int pos, int val) {
    Erase(T[idx], val);
    if(L == R) return;
    int mid = L + R >> 1;
    if(mid >= pos) Delete(idx << 1, L, mid, pos, val);
    else Delete(idx << 1 | 1, mid + 1, R, pos, val);
}
int Query_Rank(int idx, int L, int R, int QL, int QR, int val) {
    if(L >= QL && R <= QR) return Get_rank(T[idx], val);
    int mid = L + R >> 1, res = 0;
    if(mid >= QL) res += Query_Rank(idx << 1, L, mid, QL, QR, val);
    if(QR > mid) res += Query_Rank(idx << 1 | 1, mid + 1, R, QL, QR, val);
    return res;
}
int Query_Pre(int idx, int L, int R, int QL, int QR, int val) {
    if(L >= QL && R <= QR) return Pre(T[idx], val);
    int mid = L + R >> 1, res = -INF;
    if(mid >= QL) res = max(res, Query_Pre(idx << 1, L, mid, QL, QR, val));
    if(QR > mid) res = max(res, Query_Pre(idx << 1 | 1, mid + 1, R, QL, QR, val));
    return res;
}
int Query_Suf(int idx, int L, int R, int QL, int QR, int val) {
    if(L >= QL && R <= QR) return Suf(T[idx], val);
    int mid = L + R >> 1, res = INF;
    if(mid >= QL) res = min(res, Query_Suf(idx << 1, L, mid, QL, QR, val));
    if(QR > mid) res = min(res, Query_Suf(idx << 1 | 1, mid + 1, R, QL, QR, val));
    return res;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    srand(19260817);
    cin >> n >> m;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i];
        Add(1, 1, n, i, a[i]);
    }
    while(m--) {
        cin >> op;
        if(op == 1) {
            cin >> l >> r >> x;
            cout << Query_Rank(1, 1, n, l, r, x) + 1 << endl;
        }
        else if(op == 2) {
            cin >> l >> r >> x;
            int L = 0, R = 1e8;
            while(L < R) {
                int mid = (L + R + 1) >> 1;
                if(Query_Rank(1, 1, n, l, r, mid) < x) L = mid;
                else R = mid - 1;
            }
            cout << R << endl;
        }
        else if(op == 3) {
            cin >> pos >> x;
            Delete(1, 1, n, pos, a[pos]);
            a[pos] = x;
            Add(1, 1, n, pos, a[pos]);
        }
        else if(op == 4) {
            cin >> l >> r >> x;
            cout << Query_Pre(1, 1, n, l, r, x) << endl;
        }
        else if(op == 5) {
            cin >> l >> r >> x;
            cout << Query_Suf(1, 1, n, l, r, x) << endl;
        }
    }
}