题目
题解
权值线段树作用是求固定区间内静态第k大,加个可持久化,就变成静态区间第k大
#include<bits/stdc++.h>
using namespace std;
const int N=200003,M=5000003;
#define mid (l+r>>1)
int a[N],b[N],L[M],R[M],sum[M],tot,i,T[M],rt,n,q,m,x,y,k;
inline int read(){
char c;int x=0,f=1;
do{c=getchar();if (c=='-') f=-1;}while (c<'0' || c>'9');
while ('0'<=c && c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
return f*x;
}
int build(int l,int r){
int rt=++tot;
if (l<r){
L[rt]=build(l,mid);
R[rt]=build(mid+1,r);
}
return rt;
}
int update(int pre,int l,int r,int x){
int rt=++tot;
L[rt]=L[pre];R[rt]=R[pre];sum[rt]=sum[pre]+1;
if (l<r){
if (x<=mid) L[rt]=update(L[pre],l,mid,x);
else R[rt]=update(R[pre],mid+1,r,x);
}
return rt;
}
int query(int x,int y,int l,int r,int k){
if (l==r) return l;
int t=sum[L[y]]-sum[L[x]];
if (k<=t) return query(L[x],L[y],l,mid,k);
else return query(R[x],R[y],mid+1,r,k-t);
}
int main(){
n=read();q=read();
for (i=1;i<=n;i++) a[i]=b[i]=read();
sort(b+1,b+n+1);
m=unique(b+1,b+n+1)-b-1;
T[0]=build(1,m);
for (i=1;i<=n;i++){
a[i]=lower_bound(b+1,b+m+1,a[i])-b;
T[i]=update(T[i-1],1,m,a[i]);
}
while (q--){
x=read();y=read();k=read();
printf("%d\n",b[query(T[x-1],T[y],1,m,k)]);
}
}