区间第K小（可持久化线段树）

问题

• 给定一个序列$a_1，a_2，\cdots ，a_n$，$m$ 次操作，每次给定 $l，r，k$，问$a_l，a_{l+1}，\cdots ，a_r$中第 $k$ 小的值.
  • $1\le a_i\le n$
  • $1\le n，m\le 100000$
  • $1\le l\le r\le n，1\le k\le r-l+1$

分析

• 序 $\to$ 时间
• n棵线段树维护各个时刻的各个数字的出现次数
• 增量持久化策略优化线段树

代码

一般形式

#include<bits/stdc++.h>
using namespace std;
const int MXN = 1e5+5;
int N, M, tot, ver[MXN];
struct TreeNode{
	int l, r, sum;
}tree[MXN*20];
int build(int l, int r){
	int root = ++tot;
	tree[root].sum = 0;
	if(l == r) return root;
	int mid = (l+r)>>1;
	tree[root].l = build(l, mid); // 左子树
	tree[root].r = build(mid+1, r); // 右子树
	return root;
}
void pushup(int root){
	TreeNode &rt = tree[root];
	TreeNode &ls = tree[rt.l], &rs = tree[rt.r];
	rt.sum = ls.sum + rs.sum;
}
int change(int node, int l, int r, int pos){ // node：待更新的子树
	int root = ++tot;
	TreeNode &rt = tree[root];
	rt = tree[node]; // 复制
	if(l == r){
		rt.sum += 1;
		return root;
	}
	int mid = (l+r)>>1;
	if(pos <= mid) rt.l = change(rt.l, l, mid, pos);
	else rt.r = change(rt.r, mid+1, r, pos);
	pushup(root); // 上推更新
	return root;
}
int query(int pre, int lst, int l, int r, int k){
	if(l == r) return r;
	TreeNode &pn = tree[pre], &ln = tree[lst];
	int x = tree[ln.l].sum - tree[pn.l].sum;
	int mid = (l+r)>>1;
	if(x >= k) return query(pn.l, ln.l, l, mid, k);
	else return query(pn.r, ln.r, mid+1, r, k-x);
}
int main(){
	int t, x, L, R, K;
	scanf("%d", &t);	
	while(t--){
		tot = 0;
		scanf("%d%d", &N, &M);
		ver[0] = build(1, N);       
		for(int i = 1; i <= N; ++i){
			scanf("%d", &x);		
			ver[i] = change(ver[i-1], 1, N, x);
		}
		while(M--){
			scanf("%d%d%d", &L, &R, &K);
			printf("%d\n", query(ver[L-1], ver[R], 1, N, K));
		}
	}
    return 0;
}

简捷形式

#include<bits/stdc++.h>
using namespace std;
const int MXN = 1e5+5;
int N, M, tot, ver[MXN];
struct TreeNode{
	int l, r, sum;
}tree[MXN*20];
int build(int l, int r){ // 初始树
	int root = ++tot;
	tree[root].sum = 0;	
	tree[root].l = root;
	tree[root].r = root;
	return root;
}
int change(int node, int l, int r, int pos){
	int root = ++tot;
	TreeNode &rt = tree[root];
	rt = tree[node], ++rt.sum;
	if(l == r) return root;
	int mid = (l+r)>>1;
	if(pos <= mid) rt.l = change(rt.l, l, mid, pos);
	else rt.r = change(rt.r, mid+1, r, pos);
	return root;
}
int query(int pre, int lst, int l, int r, int k){
	if(l == r) return r;
	TreeNode &pn = tree[pre], &ln = tree[lst];
	int x = tree[ln.l].sum - tree[pn.l].sum;
	int mid = (l+r)>>1;
	if(x >= k) return query(pn.l, ln.l, l, mid, k);
	else return query(pn.r, ln.r, mid+1, r, k-x);
}
int main(){
	int t, x, L, R, K;
	scanf("%d", &t);	
	while(t--){
		tot = 0;
		scanf("%d%d", &N, &M);
		ver[0] = build(1, N);       
		for(int i = 1; i <= N; ++i){
			scanf("%d", &x);		
			ver[i] = change(ver[i-1], 1, N, x);
		}
		while(M--){
			scanf("%d%d%d", &L, &R, &K);
			printf("%d\n", query(ver[L-1], ver[R], 1, N, K));
		}
	}
    return 0;
}