zoj 2112 Dynamic Rankings

原题链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1112

 #include<cstdio>
 #include<cstdlib>
 #include<cstring>
 #include<algorithm>
 #define lc root<<1
 #define rc root<<1|1
 #define INF 0x3f3f3f3f
 const int Max_N = ;
 struct SBT{
     int key, size, cnt;
     SBT *ch[];
     inline void push_up(){
         size = ch[]->size + ch[]->size + cnt;
     }
     int cmp(int v) const{
         if (v == key) return -;
         return v > key;
     }
 }*null, stack[Max_N * ], *ptr[Max_N << ];
 int sz = , sum = , arr[Max_N];
 void init(){
     null = &stack[sz++];
     null->key = null->size = null->cnt = ;
 }
 void rotate(SBT* &x, int d){
     SBT *k = x->ch[!d];
     x->ch[!d] = k->ch[d];
     k->ch[d] = x;
     k->size = x->size;
     x->push_up();
     x = k;
 }
 void Maintain(SBT* &x, int d){
     if (x->ch[d] == null) return;
     if (x->ch[d]->ch[d]->size > x->ch[!d]->size){
         rotate(x, !d);
     } else if (x->ch[d]->ch[!d]->size > x->ch[!d]->size){
         rotate(x->ch[d], d), rotate(x, !d);
     } else {
         return;
     }
     Maintain(x, ), Maintain(x, );
 }
 void insert(SBT* &x, int key){
     if (x == null){
         x = &stack[sz++];
         x->ch[] = x->ch[] = null;
         x->key = key, x->size = x->cnt = ;
     } else {
         int d = x->cmp(key);
         x->size++;
         if (- == d){
             x->cnt++;
             return;
         }
         insert(x->ch[d], key);
         x->push_up();
         Maintain(x, d);
     }
 }
 void del(SBT* &x, int key){
     if (x == null) return;
     int d = x->cmp(key);
     x->size--;
     if (- == d){
         if (x->cnt > ){
             x->cnt--;
         } else if (x->ch[] == null || x->ch[] == null){
             x = x->ch[] != null ? x->ch[] : x->ch[];
         } else {
             SBT *ret = x->ch[];
             for (; ret->ch[] != null; ret = ret->ch[]);
             del(x->ch[], x->key = ret->key);
         }
     } else {
         del(x->ch[d], key);
     }
     if (x != null) x->push_up();
 }
 int sbt_rank(SBT *x, int key){
     int t, cur;
     for (t = cur = ; x != null;){
         t = x->ch[]->size;
         if (key < x->key) x = x->ch[];
         else if (key >= x->key) cur += x->cnt + t, x = x->ch[];
     }
     return cur;
 }
 void seg_built(int root, int l, int r){
     for (int i = l; i <= r; i++) insert(ptr[root], arr[i]);
     if (l == r) return;
     int mid = (l + r) >> ;
     seg_built(lc, l, mid);
     seg_built(rc, mid + , r);
 }
 void seg_query(int root, int l, int r, int x, int y, int val){
     if (x > r || y < l) return;
     if (x <= l && y >= r){
         sum += sbt_rank(ptr[root], val);
         return;
     }
     int mid = (l + r) >> ;
     seg_query(lc, l, mid, x, y, val);
     seg_query(rc, mid + , r, x, y, val);
 }
 void seg_del(int root, int l, int r, int pos, int val){
     if (pos > r || pos < l) return;
     del(ptr[root], val);
     if (l == r) return;
     int mid = (l + r) >> ;
     seg_del(lc, l, mid, pos, val);
     seg_del(rc, mid + , r, pos, val);
 }
 void seg_insert(int root, int l, int r, int pos, int val) {
     if (pos > r || pos < l) return;
     insert(ptr[root], val);
     if (l == r) return;
     int mid = (l + r) >> ;
     seg_insert(lc, l, mid, pos, val);
     seg_insert(rc, mid + , r, pos, val);
 }
 void gogo(int n, int a, int b, int k){
     int l = , r = INF;
     while (l < r){
         sum = ;
         int mid = (l + r) >> ;
         seg_query(, , n, a, b, mid);
         if (sum < k) l = mid + ;
         else r = mid;
     }
     printf("%d\n", l);
 }
 int main(){
 #ifdef LOCAL
     freopen("in.txt", "r", stdin);
     freopen("out.txt", "w+", stdout);
 #endif
     char ch;
     int t, n, m, a, b, k;
     scanf("%d", &t);
     while (t--){
         sz = , init();
         scanf("%d %d", &n, &m);
         for (int i = ; i <= n; i++) scanf("%d", &arr[i]);
         std::fill(ptr, ptr + (n << ), null);
         seg_built(, , n);
         while (m--){
             getchar();
             scanf("%c", &ch);
             if (ch == 'Q'){
                 scanf("%d %d %d", &a, &b, &k);
                 gogo(n, a, b, k);
             } else {
                 scanf("%d %d", &a, &b);
                 seg_del(, , n, a, arr[a]);
                 seg_insert(, , n, a, arr[a] = b);
             }
         }
     }
     return ;
 }