主席树（静态区间查询第k大数）

转载：

https://blog.csdn.net/creatorx/article/details/75446472

https://blog.csdn.net/your_eyes_see_sea/article/details/77801856

https://blog.csdn.net/a_forever_dream/article/details/80450549

poj 2104

#include<cstdio>
#include<iostream>
#include<algorithm>
#define LL long long
using namespace std;
const int maxn=100005;
int n,m,cnt;
struct value
{
	int val,id;
	friend bool operator <(value a,value b)
	{
		return a.val<b.val;
	}
}value[maxn];
int rank[maxn],root[maxn]; 
struct node
{
	int l,r,sum;
	node()
	{
		sum=0;
	}
}tree[maxn*20];
void init()
{
	cnt=1;
	root[0]=0;
	tree[0].l=tree[0].r=tree[0].sum=0;
}
void update(int num,int &rt,int l,int r)
{
	tree[cnt]=tree[rt];
	rt=cnt;
	cnt++;
	tree[rt].sum++;
	if(l==r) return ;
	int mid=(l+r)>>1;
	if(num<=mid)
		update(num,tree[rt].l,l,mid);
	else
		update(num,tree[rt].r,mid+1,r);
}
int query(int i,int j,int k,int l,int r)
{
	if(l==r)
		return l;
	int d=tree[tree[j].l].sum-tree[tree[i].l].sum;
	int mid=(l+r)>>1;
	if(k<=d)
		return query(tree[i].l,tree[j].l,k,l,mid);
	else
		return query(tree[i].r,tree[j].r,k-d,mid+1,r);
}
int main()
{
	scanf("%d %d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&value[i].val);
		value[i].id=i;
	}
	sort(value+1,value+1+n);
	for(int i=1;i<=n;i++)
	{
		rank[value[i].id]=i;
	}

	init();
	for(int i=1;i<=n;i++)
	{
		root[i]=root[i-1];
		update(rank[i],root[i],1,n);
	}
	for(int i=1;i<=m;i++)
	{
		int left,right,k;
		scanf("%d %d %d",&left,&right,&k);
		int ans=value[query(root[left-1],root[right],k,1,n)].val;
		printf("%d\n",ans);
	}
	return 0;
}