[主席树|静态区间第k大]luogu3834

题目

题目

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
struct sut{
	int num,id;
}a[200010];
struct node{
	int l,r,sum;
}tree[5000000];
int root[200010];
int n,m;
int ys[200010],b[200010];
bool cmp(sut a,sut b){
	return a.num<b.num;
}
int cnt=0,k=0;
void lsort(){
	for(int i=1;i<=n;i++){
		if(i==1||(i>1&&a[i].num!=a[i-1].num)){
			b[a[i].id]=++cnt;
			ys[cnt]=a[i].num;
		}
		else{
			b[a[i].id]=cnt;
			ys[cnt]=a[i].num;
		}
	}
}
int build(int l,int r){
	int now=++k;
	if(l<r){
		int mid=(l+r)>>1;
		tree[now].l=build(l,mid);
		tree[now].r=build(mid+1,r);
	}
	return now;
}

int update(int pre,int l,int r,int x){
	int now=++k;
	tree[now].sum=tree[pre].sum+1;
	tree[now].l=tree[pre].l;
	tree[now].r=tree[pre].r;
	if(l<r){
		int mid=(l+r)>>1;
		if(x>mid) tree[now].r=update(tree[now].r,mid+1,r,x);
		else tree[now].l=update(tree[now].l,l,mid,x);
	}
	return now;
}
int query(int u,int v,int l,int r,int x){
	if(l==r) return l;
	int t=tree[tree[v].l].sum-tree[tree[u].l].sum;
	int mid=(l+r)>>1;
	if(x<=t){
		return query(tree[u].l,tree[v].l,l,mid,x);
	}
	else{
		return query(tree[u].r,tree[v].r,mid+1,r,x-t);
	}
	
}

int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>a[i].num,a[i].id=i;
	sort(a+1,a+1+n,cmp);
	lsort();
	root[0]=build(1,n);
	for(int i=1;i<=n;i++){
		root[i]=update(root[i-1],1,n,b[i]);
	}
	for(int i=1;i<=m;i++){
		int l,r,k;
		cin>>l>>r>>k;
		cout<<ys[query(root[l-1],root[r],1,n,k)]<<endl;
	}
}
//