划分树 POJ2104

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=101000;
int m,n,a[maxn];
struct node{
	int w[maxn],s[maxn];
}tree[50];
void Create_Tree(int d,int l,int r){
	if(l==r)return ;
	int mid=l+r>>1,num=0,cnt=0,x=l,y=mid+1;
	for(int i=mid;a[i]==a[mid];i--)num++;
	for(int i=l;i<=r;i++){
		if(tree[d].w[i]<a[mid]){
			tree[d+1].w[x++]=tree[d].w[i];
			tree[d].s[i]=++cnt;
			continue;
		}else if(tree[d].w[i]>a[mid]){
			tree[d+1].w[y++]=tree[d].w[i];
			tree[d].s[i]=cnt;
			continue;
		}
		if(num){
			tree[d+1].w[x++]=tree[d].w[i];
			tree[d].s[i]=++cnt;
			num--;
		}else{
			tree[d+1].w[y++]=tree[d].w[i];
			tree[d].s[i]=cnt;
		}
	}
	Create_Tree(d+1,l,mid);
	Create_Tree(d+1,mid+1,r);
}
bool cmp(int a,int b){return a<b;}
int k_num(int d,int l,int r,int k,int x,int y){
	//cout<<d<<" "<<l<<" "<<r<<" "<<k<<endl;
	if(l==r)return tree[d].w[l];
	int mid=x+y>>1,s_pre,s_query;
	if(l==x){
		s_pre=0;
		s_query=tree[d].s[r];
	}else{
		s_pre=tree[d].s[l-1];
		s_query=tree[d].s[r]-s_pre;
	}if(k<=s_query)return k_num(d+1,x+s_pre,x+s_query+s_pre-1,k,x,mid);
	else return k_num(d+1, mid+1+l-x-s_pre , mid+r-s_query-s_pre-x+1 ,k-s_query,mid+1,y);
}
int main(){
	int i,j,k,T;
	scanf("%d%d",&n,&T);
	for(i=1;i<=n;i++){
		scanf("%d",&tree[1].w[i]);
		a[i]=tree[1].w[i];
	}
	sort(a+1,a+n+1,cmp);
	Create_Tree(1,1,n);
	while(T--){
		int x,y;
		scanf("%d%d%d",&x,&y,&k);
		int ans=k_num(1,x,y,k,1,n);
		printf("%d\n",ans);
	}
	return 0;
}