hdu 4217 Data Structure?/treap

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=4217

可用线段树写，效率要高点。

这道题以前用c语言写的treap水过了。。

现在接触了c++重写一遍。。。

不带重复元素的插入删除第k大带垃圾回收，具体如下：

 #include<cstdio>
 #include<cstdlib>
 #include<iostream>
 #include<algorithm>
 typedef long long ll;
 const int MAX_N = ;
 struct Node{
     int v, s, fix;
     Node *ch[];
     inline void
     set(int _fix, int _v = , int _s = , Node *p = NULL){
         fix = _fix, v = _v, s = _s;
         ch[] = ch[] = p;
     }
     inline void push_up(){
         s = ch[]->s + ch[]->s + ;
     }
 };
 int run(){
     static int x = ;
     x += (x << ) | ;
     return x;
 }
 struct Treap{
     Node *tail, *null, *root;
     Node stack[MAX_N];
     int top;
     Node *store[MAX_N];
     void init(){
         tail = &stack[];
         null = tail++;
         null->set(0x7fffffff);
         root = null;
         top = ;
     }
     inline Node *newNode(int v){
         Node *p = null;
         if (top) p = store[--top];
         else p = tail++;
         p->set(run(), v, , null);
         return p;
     }
     inline void rotate(Node* &x, int d){
         Node *k = x->ch[!d];
         x->ch[!d] = k->ch[d];
         k->ch[d] = x;
         k->s = x->s;
         x->push_up();
         x = k;
     }
     inline void insert(Node* &x, int v){
         if (x == null){
             x = newNode(v);
             return;
         } else {
             int d = v > x->v;
             insert(x->ch[d], v);
             if (x->ch[d]->fix < x->fix) rotate(x, !d);
             x->push_up();
         }
     }
     inline void del(Node* &x, int v){
         if (x == null) return;
         x->s--;
         if (x->v == v){
             if (x->ch[] == null || x->ch[] == null){
                 store[top++] = x;
                 x = x->ch[] == null ? x->ch[] : x->ch[];
             } else {
                 int d = x->ch[]->fix < x->ch[]->fix;
                 rotate(x, !d);
                 del(x->ch[!d], v);
             }
         } else {
             del(x->ch[v>x->v], v);
         }
         if (x != null) x->push_up();
     }
     inline int find_kth(Node *x, int k){
         int t = ;
         for (;;){
             t = x->ch[]->s;
             if (k == t + ) break;
             else if (k < t + ) x = x->ch[];
             else k -= t + , x = x->ch[];
         }
         return x->v;
     }
     inline void insert(int v){
         insert(root, v);
     }
     inline void del(int v){
         del(root, v);
     }
     inline int find_kth(int k){
         return find_kth(root, k);
     }
 }treap;
 int main(){
 #ifdef LOCAL
     freopen("in.txt", "r", stdin);
     freopen("out.txt", "w+", stdout);
 #endif
     ll ans;
     int t, n, m, k, tmp, c = ;
     scanf("%d", &t);
     while (t--){
         treap.init(), ans = ;
         scanf("%d %d", &n, &m);
         for (int i = ; i <= n; i++) treap.insert(i);
         while (m--){
             scanf("%d", &k);
             ans += tmp = treap.find_kth(k);
             treap.del(tmp);
         }
         printf("Case %d: %lld\n", c++, ans);
     }
     return ;
 }