划分树 模板

// 划分树 nlogn建树 logn查询区间第k小
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
int tree[20][maxn];//表示每层每个位置的值
int sorted[maxn];//放排好序的数
int toleft[20][maxn];//
void build(int l,int r,int dep){
    if (l == r) return ;
    int mid = l + r >> 1;
    int same = mid - l + 1;
    for (int i = l; i <= r; ++i) if (tree[dep][i] < sorted[mid]) same--;
    int lpos = l,rpos = mid+1;
    for (int i=l;i<=r;++i){
        if (tree[dep][i] < sorted[mid]) tree[dep+1][lpos++] = tree[dep][i];
        else if (tree[dep][i] == sorted[mid] && same > 0) tree[dep+1][lpos++] = tree[dep][i], same--;
        else tree[dep+1][rpos++] = tree[dep][i];
        toleft[dep][i] = toleft[dep][l-1] + lpos - l;
    }
    build(l,mid,dep+1);
    build(mid+1,r,dep+1);
    return ;
}
int query(int L,int R,int l,int r,int dep,int k){
    if (l == r) return tree[dep][l];
    int mid = L + R >> 1;
    int cnt = toleft[dep][r] - toleft[dep][l-1];
    if (cnt >= k){
        int newl = L + toleft[dep][l-1] - toleft[dep][L-1];
        int newr = newl + cnt - 1;
        return query(L,mid,newl,newr,dep+1,k);
    }
    else {
        int newr = r + toleft[dep][R] - toleft[dep][r];
        int newl = newr - (r - l - cnt);
        return query(mid+1,R,newl,newr,dep+1,k-cnt);
    }
}
int main (){
    int n,m;
    scanf("%d%d",&n,&m);
    memset(tree,0, sizeof(tree));
    for (int i=1;i<=n;++i){
        scanf("%d",&tree[0][i]);
        sorted[i] = tree[0][i];
    }
    sort(sorted+1,sorted+1+n);
    build(1,n,0);
    int l,r,k;
    while (m--){
        scanf("%d%d%d",&l,&r,&k);
        printf("%d\n",query(1,n,l,r,0,k));
    }
    return 0;
}