[数据结构]可持久化权值线段树

求解静态区间第k大，研究完毕。
http://www.51nod.com/Challenge/Problem.html#!#problemId=1175

#include<bits/stdc++.h>
using namespace std;
const int maxn = 5e4 + 5;
struct e{
    int l, r, sum = 0;
}tree[17 * maxn];
int a[maxn], b[maxn];
int cnt, root[maxn], r[maxn];

void update(int l, int r, int &x, int p)
{
    tree[++cnt] = tree[x]; ++tree[cnt].sum; x = cnt;
    if (l == r) return ;
    int m = (l + r) >> 1;
    if (p <= m) update(l, m, tree[x].l, p);
    else update(m + 1, r, tree[x].r, p);
}
int query(int l, int r, int x, int y, int k)
{
    if (l == r) return l;
    int num = tree[tree[y].l].sum - tree[tree[x].l].sum;
    int m = (l + r) >> 1;
    if (k <= num) query(l, m, tree[x].l, tree[y].l, k);
    else query(m + 1, r, tree[x].r, tree[y].r, k - num);
}
int main()
{
    int n, m;
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i){
        scanf("%d", &a[i]);
        b[i] = a[i];
    }
    sort(b + 1, b + 1 + n);
    int sz = unique(b + 1, b + 1 + n) - (b + 1);
    for (int i = 1; i <= n; ++i){
        root[i] = root[i - 1];
        update(1, sz, root[i], lower_bound(b + 1, b + 1 + sz, a[i]) - b);
    }
    int l, r, k;
    scanf("%d", &m);
    while (m--){
        scanf("%d %d %d", &l, &r, &k);
        ++l, ++r;
        printf("%d\n", b[query(1, sz, root[l - 1], root[r], (r - k + 1) - l + 1)]);
    }
    return 0;
}