划分树 K-th Number POJ - 2104

划分树，类似线段树，主要用于求解某个区间的第k 大元素（时间复杂度log(n)）

讲解：https://www.cnblogs.com/hchlqlz-oj-mrj/p/5744308.html

大致就是分治递归的思想：

int tree[22][N]; //对应每层每个位置的数
int num[22][N]; //对应每层每个位置前面进入左孩子个数

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e5 + 10;
int a[N], b[N];
int tree[22][N];
int num[22][N]; //进入左孩子个数
int n, m;
void build(int l, int r, int cur) {
	if(l == r) return;
	int mid = (l + r) >> 1;
	int lson = mid - l + 1;
	for(int i = l; i <= r; i++)
		if(tree[cur][i] < b[mid])
			lson--;
	int ln = l, rn = mid + 1;
	for(int i = l; i <= r; i++) {
		if(i == l) num[cur][i] = 0;
		else num[cur][i] = num[cur][i - 1];
		if(tree[cur][i] < b[mid] || (tree[cur][i] == b[mid] && lson > 0)) {
			tree[cur + 1][ln++] = tree[cur][i];
			num[cur][i]++;
			if(tree[cur][i] == b[mid]) lson--;
		} else {
			tree[cur + 1][rn++] = tree[cur][i];
		}
	}
	build(l, mid, cur + 1);
	build(mid + 1, r, cur + 1);
}
int query(int pl, int pr, int l, int r, int cur, int k) {
	if(l == r) return tree[cur][l];
	int lson;
	int mid = (l + r) >> 1;
	if(pl == l) lson = 0;
	else lson = num[cur][pl - 1];
	int cnt = num[cur][pr] - lson;
	if(cnt >= k) {
		return query(l + lson, l + num[cur][pr] - 1, l, mid, cur + 1, k);
	} else {
		int posr = mid + 1 + (pl - l - lson); // 右子树中第一个位置 
		return query(posr, posr + (pr - pl + 1 - cnt) - 1, mid + 1, r, cur + 1, k - cnt); 
	}
}
int main() {
	int l, r, k;
	while(~scanf("%d %d", &n, &m)) {
		for(int i = 1; i <= n; i++) {
			scanf("%d", &a[i]);
			b[i] = a[i];
			tree[0][i] = a[i];
		}
		sort(b + 1, b + 1 + n);
		build(1, n, 0);
		while(m--) {
			scanf("%d %d %d", &l, &r, &k);
			printf("%d\n", query(l, r, 1, n, 0, k));
		}
	}
	return 0;
}