題目連結:http://acm.hdu.edu.cn/showproblem.php?pid=2665
#include<algorithm>
#include<iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<ll,ll>
#define mk(x,y) make_pair(x,y)
const int maxn =100010;
const int mod=998244353;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
int tree[30][maxn],sorted[maxn];///
int toleft[30][maxn];///表示第p層從1到i中有多少個數被劃分到下一層的左子區間中
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);
}
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 t;scanf("%d",&t);
int n,m;
while(t--)
{
mst(tree,0);
scanf("%d%d",&n,&m);
{
for(int i=1;i<=n;i++)
{
scanf("%d",&tree[0][i]);
sorted[i]=tree[0][i];
}
sort(sorted+1,sorted+n+1);
build(1,n,0);
while(m--)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
printf("%d\n",query(1,n,a,b,0,c));
}
}
}
return 0;
}