【主席树】luogu_3834 可持久化线段树 1（主席树）

题意

给出一个数列，求出$l\sim r$中第$k$小的数是多少。

思路

用线段树维护值域上每个数出现的次数，那么可以一个数一个数地插入，利用到前缀和的思想，用第$r$次插入后的线段树减去第$l-1$次插入的线段树就可以求出$l\sim r$中每个数出现的次数，进而可以用分治求出第$k$大的数。主席树就提供了支持了查询历史版本的线段树。

代码

#include<cstdio>
#include<algorithm>

struct SegmentTree {
	int lc, rc;
	int dat;
} tree[4200001];
int a[200001], b[200001], root[200001];
int tot, n, m, t;

int build(int l, int r) {
	int p = ++tot;
	if (l == r) return p;
	int mid = (l + r) >> 1;
	tree[p].lc = build(l, mid);
	tree[p].rc = build(mid + 1, r);
	return p;
}

int insert(int now, int l, int r, int x, int val) {
	int p = ++tot;
	tree[p] = tree[now];
	if (l == r) {
		tree[p].dat += val;
		return p;
	}
	int mid = (l + r) >> 1;
	if (x <= mid)
		tree[p].lc = insert(tree[now].lc, l, mid, x, val);
	else
		tree[p].rc = insert(tree[now].rc, mid + 1, r, x, val);
	tree[p].dat = tree[tree[p].lc].dat + tree[tree[p].rc].dat;
	return p;
}

int ask(int p, int q, int l, int r, int k) {
	if (l == r) return l;
	int mid = (l + r) >> 1;
	int lcnt = tree[tree[p].lc].dat - tree[tree[q].lc].dat;
	if (k <= lcnt) return ask(tree[p].lc, tree[q].lc, l, mid, k);
	else return ask(tree[p].rc, tree[q].rc, mid + 1, r, k - lcnt);
}

int main() {
	scanf("%d %d", &n, &t);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
		b[i] = a[i];
	}
	std::sort(b + 1, b + n + 1);
	m = std::unique(b + 1, b + n + 1) - b - 1;
	root[0] = build(1, m);
	for (int i = 1; i <= n; i++) {
		a[i] = std::lower_bound(b + 1, b + m + 1, a[i]) - b;
		root[i] = insert(root[i - 1], 1, m, a[i], 1);
	}
	int l, r, k;
	while (t--) {
		scanf("%d %d %d", &l, &r, &k);
		printf("%d\n", b[ask(root[r], root[l - 1], 1, m, k)]);
	}
}