主席树

区间查询无修改

这里是简单的区间第k大（我能说我以前只会用mst预处理的离线splay么），chairmantree的代码高端大气上档次，飘逸灵活逼格高
hdu2665

#include<bits/stdc++.h>
using namespace std;
#define SC scanf
#define U_(i,a,b) for(int i=a;i<=b;i++)
#define D_(i,a,b) for(int i=a;i>=b;i--)
typedef long long ll;
#define MK make_pair
#define A first
#define B second
#define lc(i) T[i].l
#define rc(i) T[i].r
#define w(i) T[i].w
#define gm int mid=l+r>>1
const int MAXN=101000;
int n,m;
int a[MAXN],p[MAXN],b[MAXN];
bool cmp(int i,int j){return a[i]<a[j];}
typedef struct Node{int l,r,w;Node(){l=r=w=0;}}Node;
Node T[MAXN*20];
int rot[MAXN],cnt;
void ins(int &i,int l,int r,int x){
    T[++cnt]=T[i];i=cnt;w(i)++;
    if(l==r)return;
    gm;if(x<=mid)ins(lc(i),l,mid,x);else ins(rc(i),mid+1,r,x);
}
int query(int i,int j,int l,int r,int k){
    if(l==r)return l;
    int t=w(lc(j))-w(lc(i));
    gm;if(t>=k)return query(lc(i),lc(j),l,mid,k);else return query(rc(i),rc(j),mid+1,r,k-t);
}
int main(){
    int cas;
    SC("%d",&cas);
    while(cas--){
        SC("%d%d",&n,&m);
        U_(i,1,n)SC("%d",&a[i]);
        U_(i,1,n)p[i]=i;
        sort(p+1,p+1+n,cmp);
        U_(i,1,n)b[p[i]]=i;
        rot[0]=0;cnt=0;
        U_(i,1,n){
            rot[i]=rot[i-1];
            ins(rot[i],1,n,b[i]);
        }
        int l,r,k;
        U_(i,1,m){
            SC("%d%d%d",&l,&r,&k);
            printf("%d\n",a[p[query(rot[l-1],rot[r],1,n,k)]]);
        }
    }
}