划分树模板

POJ 2104 K-th Number

Sample Input

7 3
1 5 2 6 3 7 4
2 5 3
4 4 1
1 7 3

Sample Output

5
6
3

 

/*---------------------------------
 *File name: 划分树.cpp
 *Author: Snpilola
 *Creation date: 2019-11-10 14:20
 *-------------------------------*/
#include<map>
#include<cmath>
#include<queue>
#include<vector>
#include<cstdio>
#include<string>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define fi first
#define se second
#define pb push_back
#define LL long long
#define mkp make_pair
#define PLL pair<LL, LL>
#define lowbit(x) x & (-x)
#define PII pair<int, int>
#define Pque priority_queue 
using namespace std;
const int maxn = 1e5 + 5;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int EPS = 1e-6;

int tree[20][maxn];//第i层的第j个数
int sorted[maxn];
int totlef[20][maxn];//第i层的1~j个数中有几个被分到左边
int n, m;

void Build(int l, int r, int dep){
	if(l == r) return;
	int mid = l + r >> 1;
	int same = mid - l + 1;//有多少个数被分到左边
	for(int i = l; i <= r; i++) if(tree[dep][i] < sorted[mid]) same--;
	int lpos = l, rpos = mid + 1;
	for(int i = l; i <= r; ++i){
		if(tree[dep][i] < sorted[mid]) tree[dep + 1][lpos++] = tree[dep][i];
		else if(tree[dep][i] == sorted[mid]) tree[dep + 1][lpos++] = tree[dep][i], same--;
		else tree[dep + 1][rpos++] = tree[dep][i];
		totlef[dep][i] = totlef[dep][l - 1] + lpos - l;
	}
	Build(l, mid, dep + 1);
	Build(mid + 1, r, dep + 1);
}
//在区间[L, R]中查询区间[l, r]的第k大
int query(int L, int R, int l, int r, int dep, int k){
	if(l == r) return tree[dep][l];
	int mid = L + R >> 1;
	int cnt = totlef[dep][r] - totlef[dep][l - 1];
	if(cnt >= k){
		int newl = L + totlef[dep][l - 1] - totlef[dep][L - 1];
		int newr = newl + cnt - 1;
		return query(L, mid, newl, newr, dep + 1, k);
	}
	else{
		int newr = r + totlef[dep][R] - totlef[dep][r];
		int newl = newr - (r - l - cnt);
		return query(mid + 1, R, newl, newr, dep + 1, k - cnt);
	}
}

int main(){
	scanf("%d %d", &n, &m);
	for(int i = 1; i <= n; ++i){
		scanf(" %d", &tree[0][i]);
		sorted[i] = tree[0][i];
	}
	sort(sorted + 1, sorted + 1 + n);
	Build(1, n, 0);
	for(int i = 1; i <= m; i++){
		int l, r, k;
		scanf("%d %d %d", &l, &r, &k);
		int ans = query(1, n, l, r, 0, k);
		printf("%d\n", ans);
	}
	return 0;
}