hdu2852 KiKi's K-Number 线段树

Description

---

For the k-th number, we all should be very familiar with it. Of course,to kiki it is also simple. Now Kiki meets a very similar problem, kiki wants to design a container, the container is to support the three operations.

Push: Push a given element e to container

Pop: Pop element of a given e from container

Query: Given two elements a and k, query the kth larger number which greater than a in container;

Although Kiki is very intelligent, she can not think of how to do it, can you help her to solve this problem?

要求一个容器中资瓷插入、删除、查找大于x的第k大的数字

Solution

---

好象很难的样子，然后其实不太难的

根据数字的范围开一棵线段树，每个区间维护在这范围内的数字的数量。查找大于x的第k大，可以通过查询x的rank计为p，那么我们可以二分答案线段树统计rank-p是否等于k(好混乱)

第一次交T了，读入优化勉强卡过，不知道是不是正解了

Code

---

#include <stdio.h>
#define rep(i, st, ed) for (int i = st; i <= ed; i += 1)
#define N 100001
struct treeNode{int l, r, c;}t[N << 2 | 1];
inline int read(){
    char ch = getchar(); int x = 0;
    while (ch < '0' || ch > '9'){
        ch = getchar();
    }
    while (ch <= '9' && ch >= '0'){
        x = (x << 1) + (x << 3) + ch - '0';
        ch = getchar();
    }
    return x;
}
inline int query(int now, int l, int r){
    int mid = (t[now].l + t[now].r) >> 1;
    if (t[now].l == l && t[now].r == r){
        return t[now].c;
    }
    if (r <= mid){
        return query(now << 1, l, r);
    }else if (l > mid){
        return query(now << 1 | 1, l, r);
    }else{
        return query(now << 1, l, mid) + query(now << 1 | 1, mid + 1, r);
    }
}
inline void modify(int now, int l, int r, int v){
    int mid = (t[now].l + t[now].r) >> 1;
    if (t[now].l == l && t[now].r == r){
        t[now].c += v;
        if (t[now].c == -1){
            t[now].c = 0;
            puts("No Elment!");
        }
        return;
    }
    if (r <= mid){
        modify(now << 1, l, r, v);
    }else if (l > mid){
        modify(now << 1 | 1, l, r, v);
    }else{
        modify(now << 1, l, mid, v);
        modify(now << 1 | 1, mid + 1, r, v);
    }
    t[now].c = t[now << 1].c + t[now << 1 | 1].c;
}
inline void build(int now, int l, int r){
    int mid = (l + r) >> 1;
    t[now] = (treeNode){l, r, 0};
    if (l == r){
        return;
    }
    build(now << 1, l, mid);
    build(now << 1 | 1, mid + 1, r);
}
int main(void){
    int T;
    while (~scanf("%d", &T)){
        build(1, 1, N - 1);
        while (T --){
            int opt = read();
            if (opt == 0){
                int x = read();
                modify(1, x, x, 1);
            }else if (opt == 1){
                int x = read();
                modify(1, x, x, -1);
            }else if (opt == 2){
                int x = read(), k = read();
                int p = query(1, 1, x);
                int l = x, r = N - 1;
                int ans = N;
                while (l <= r){
                    int mid = (l + r) >> 1;
                    int q = query(1, 1, mid);
                    if (q - p >= k){
                        r = mid - 1;
                        ans = mid;
                    }else if (q - p < k){
                        l = mid + 1;
                    }
                }
                if (ans == N){
                    puts("Not Find!");
                }else{
                    printf("%d\n", ans);
                }
            }
        }
    }
    return 0;
}