POJ 2104 K-th Number (可持久化线段树)

可持久化线段树(又曰函数式线段树or主席树。。)

今天比赛做到这种数据结构，顿时就跪了。。是我太懒。。一直没去学。。果断学之，思想简单犀利。

贴个模板

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
using namespace std;

const int N = 100000+5;

int ls[N*20], rs[N*20], cnt[N*20], hd[N], tot;

void up(int rt) {
    cnt[rt] = cnt[ls[rt]] + cnt[rs[rt]];
}

void build(int &rt, int l, int r) {
    rt = tot++;
    cnt[rt] = 0;
    if(l == r)  return ;
    int mid = l+r>>1;
    build(ls[rt], l, mid);
    build(rs[rt], mid+1, r);
    up(rt);
}

void update(int &rt, int l, int r, int pre, int x) {
    rt = tot++;
    if(l == r) {
        cnt[rt] = cnt[pre] + 1;
        return ;
    }
    int mid = l+r>>1;
    if(x <= mid)  {
        update(ls[rt], l, mid, ls[pre], x);
        rs[rt] = rs[pre];
    }
    else  {
        update(rs[rt], mid+1, r, rs[pre], x);
        ls[rt] = ls[pre];
    }
    up(rt);
}

int query(int rt, int l, int r, int pre, int k) {
    if(l == r) return l;
    int mid = l+r>>1;
    int cur = cnt[ls[rt]] - cnt[ls[pre]];
    int ret = 0;
    if(cur >= k)
        return query(ls[rt], l, mid, ls[pre], k);
    else
        return query(rs[rt], mid+1, r, rs[pre], k-cur);
}

int a[N], x[N];

int bin(int l, int r, int v) {
    while(l <= r) {
        int mid = l+r>>1;
        if(x[mid] == v) return mid;
        if(x[mid] > v)  r = mid-1;
        else    l = mid+1;
    }
}

int main() {
    int n, m;
    while(scanf("%d%d", &n, &m) == 2) {
        tot = 0;
        for(int i = 1;i <= n; i++)  scanf("%d", &a[i]), x[i] = a[i];
        sort(x+1, x+n+1);
        int tp = 1;
        for(int i = 2;i <= n ;i++) if(x[i] != x[i-1])
            x[++tp] = x[i];
        build(hd[0], 1, tp);
        for(int i = 1;i <= n; i++) {
            int pos = bin(1, tp, a[i]);
            update(hd[i], 1, tp, hd[i-1], pos);
        }
        while(m--) {
            int l, r, k;
            scanf("%d%d%d", &l, &r, &k);
            printf("%d\n", x[query(hd[r], 1, tp, hd[l-1], k)]);
        }
    }
    return 0;
}