P3834 【模板】可持久化线段树 2 静态区间第k小模板

题目链接：【模板】可持久化线段树 2 - 洛谷 

 静态区间第k小模板

#include<bits/stdc++.h>
using namespace std;
#define N 200005
#define endl "\n"
struct node{
	int l, r;
	int cnt;
}tree[N * 40];
int a[N];
vector<int> ve;
int cnt;
int arr[N];
int build(int rt, int l, int r){
	tree[++cnt] = tree[rt];
	rt = cnt;
	tree[rt].cnt = 0;
	if(l == r){
		return rt;
	}
	int mid = (l + r) / 2;
	tree[rt].l = build(tree[rt].l, l, mid);
	tree[rt].r = build(tree[rt].r, mid + 1, r);
	return rt;
}
void pushup(int rt, int l, int r){
	tree[rt].cnt = tree[l].cnt + tree[r].cnt;
}
int updata(int rt, int l, int r, int k){
	tree[++cnt] = tree[rt];
	rt = cnt;
	if(l == r){
		tree[rt].cnt++;
		return rt;
	}
	int mid = (l + r) / 2;
	if(k <= mid){
		tree[rt].l = updata(tree[rt].l, l, mid, k);
	}else{
		tree[rt].r = updata(tree[rt].r, mid + 1, r, k);
	}
	pushup(rt, tree[rt].l, tree[rt].r);
	return rt;
}
int query(int rrt, int lrt, int l, int r, int k){
	if(l == r){
		return r;
	}
	int cnt = tree[tree[rrt].l].cnt - tree[tree[lrt].l].cnt;
	int mid = (l + r) / 2;
	if(k <= cnt){
		return query(tree[rrt].l, tree[lrt].l, l, mid, k);
	}else{
		return query(tree[rrt].r, tree[lrt].r, mid + 1, r, k - cnt);
	}
}
int findx(int x){
	return lower_bound(ve.begin(), ve.end(), x) - ve.begin();
}
int main(){
	ios::sync_with_stdio(false);
	int n, m;
	while(cin >> n >> m){
		ve.clear();
		cnt = 0;
		for(int i = 1; i <= n; i++){
			cin >> a[i];
			ve.push_back(a[i]);
		}
		sort(ve.begin(), ve.end());
		ve.erase(unique(ve.begin(), ve.end()) ,ve.end());
		arr[0] = build(0, 0, ve.size() - 1);
		for(int i = 1; i <= n; i++){
			arr[i] = updata(arr[i - 1], 0, ve.size() - 1, findx(a[i]));
		}
		for(int i = 0; i < m; i++){
			int l, r, k;
			cin >> l >> r >> k;
			cout << ve[query(arr[r], arr[l - 1], 0, ve.size() - 1, k)] << endl;
		}
	}
	return 0;
}