ZOJ 2112 Dynamic Rankings(树套树)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>

using namespace std;

#define LL long long
#define pii pair<int, int>
#define MP make_pair
#define ls i << 1
#define rs ls | 1
#define md (ll + rr >> 1)
#define lson ll, md, ls
#define rson md + 1, rr, rs
#define inf 0x3f3f3f3f
#define mod 1000000007
#define N 50010
#define M 400020

int ch[N*20][2], rand_val[N*20], key[N*20], sz[N*20], cnt[N*20];
int tot, rt[N<<2], a[N];
int creat(int val){
    ++tot;
    ch[tot][0] = ch[tot][1] = 0;
    rand_val[tot] = rand();
    key[tot] = val;
    sz[tot] = cnt[tot] = 1;
    return tot;
}
int cmp(int x, int val){
    if(key[x] == val) return -1;
    return val < key[x] ? 0 : 1;
}
void push_up(int x){
    sz[x] = sz[ch[x][0]] + sz[ch[x][1]] + cnt[x];
}
void rot(int &x, int d){
    int k = ch[x][!d];
    ch[x][!d] = ch[k][d];
    ch[k][d] = x;
    push_up(x);
    push_up(k);
    x = k;
}
void insert(int &x, int val){
    if(x == 0){
        x = creat(val);
        return ;
    }
    int d = cmp(x, val);
    if(d == -1){
        cnt[x]++, sz[x]++;
        return ;
    }
    insert(ch[x][d], val);
    if(rand_val[ch[x][d]] > rand_val[x]) rot(x, d ^ 1);
    push_up(x);
}
void del(int &x, int val){
    if(x == 0) return ;
    int d = cmp(x, val);
    if(d == -1){
        if(cnt[x] > 1){
            cnt[x]--, sz[x]--;
            return ;
        }
        if(!ch[x][0]) x = ch[x][1];
        else if(!ch[x][1]) x = ch[x][0];
        else{
            int d2 = rand_val[ch[x][0]] > rand_val[ch[x][1]] ? 1 : 0;
            rot(x, d2);
            del(ch[x][d2], val);
        }
    }
    else del(ch[x][d], val);
    if(x) push_up(x);
}
int kth_rank(int x, int val){
    if(!x) return 0;
    int d = cmp(x, val);
    if(d == -1)
        return sz[ch[x][0]] + cnt[x];
    if(d == 0)
        return kth_rank(ch[x][0], val);
    return kth_rank(ch[x][1], val) + sz[ch[x][0]] + cnt[x];
}
void build(int ll, int rr, int i){
    rt[i] = 0;
    for(int j = ll; j <= rr; ++j)
        insert(rt[i], a[j]);
    if(ll == rr) return ;
    build(lson);
    build(rson);
}
void update(int x, int pre, int cur, int ll, int rr, int i){
    del(rt[i], pre);
    insert(rt[i], cur);
    if(ll == rr) return ;
    if(x <= md) update(x, pre, cur, lson);
    else update(x, pre, cur, rson);
}
int query(int l, int r, int v, int ll, int rr, int i){
    if(l <= ll && r >= rr)
        return kth_rank(rt[i], v);
    if(r <= md) return query(l, r, v, lson);
    else if(l > md) return query(l, r, v, rson);
    else return query(l, md, v, lson) + query(md + 1, r, v, rson);
}
int main(){
    int cas;
    scanf("%d", &cas);
    while(cas--){
        tot = 0;
        int n, m;
        scanf("%d%d", &n, &m);
        for(int i = 1; i <= n; ++i)
            scanf("%d", &a[i]);
        build(1, n, 1);
        while(m--){
            int l, r, v;
            char s[5];
            scanf("%s", s);
            if(s[0] == 'C'){
                scanf("%d%d", &l, &v);
                int pre = a[l];
                update(l, pre, v, 1, n, 1);
                a[l] = v;
            }
            else{
                scanf("%d%d%d", &l, &r, &v);
                int L = 0, R = inf;
                while(L < R){
                    int mid = (L + R) >> 1;
                    if(query(l, r, mid, 1, n, 1) >= v)
                        R = mid;
                    else L = mid + 1;
                }
                printf("%d\n", L);
            }
        }
    }
    return 0;
}