主席树（可持久化权值线段树）

详解

• 板子

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn = 2e5 + 10;
int n, m;
int cnt;
struct node {
	int L, R;//·Ö±ðÖ¸Ïò×óÓÒ×ÓÊ÷
	int sum;//¸Ã½ÚµãËù¹ÜϽÇø¼ä·¶Î§ÄÚÊýµÄ¸öÊý
	node() {
		sum = 0;
	}
} Tree[maxn * 20];
struct value {
	int x;//ÖµµÄ´óС
	int id;//Àëɢ֮ǰÔÚÔ­Êý×éÖеÄλÖÃ
} Value[maxn];
bool cmp(value v1, value v2) {
	return v1.x < v2.x;
}
int root[maxn];//¶à¿ÅÏ߶ÎÊ÷µÄ¸ù½Úµã
int rank[maxn];//Ô­Êý×éÀëÉ¢Ö®ºóµÄÊý×é
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 - 1;
	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) {
	int d = Tree[Tree[j].L].sum - Tree[Tree[i].L].sum;
	if(l == r) return l;
	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() {
	freopen("t.in","r",stdin);
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= n; i++) {
		scanf("%d", &Value[i].x);
		Value[i].id = i;
	}
	//½øÐÐÀëÉ¢»¯
	sort(Value + 1, Value + n + 1, cmp);
	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);
	}
	int left, right, k;
	for(int i = 1; i <= m; i++) {
		scanf("%d%d%d", &left, &right, &k);
		printf("%d\n", Value[query(root[left - 1], root[right], k, 1, n)].x);
	}
	return 0;
}