题目链接:https://www.luogu.org/problem/show?pid=3834
题意
给定N个正整数构成的序列,将对于指定的闭区间查询其区间内的第K小值
- 第一步:学会写权值线段树,即存储区间内某数字出现次数
- 第二步:对于序列的每一个前缀建立好一棵这样的树
- 第三步:运用类似链表的结构,将无需修改的节点向后传递
这样就成功地建出了一棵主席树,其具有可加减,省空间等等优良性质
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 205000;
int a[maxn], c[maxn], d[maxn], v[maxn*20], ls[maxn*20], rs[maxn*20], rt[maxn], n, m, tot, p;
struct point {
int val, rank;
point(int val=0, int rank=0) : val(val), rank(rank) {}
bool operator < (const point &A) const {
return val < A.val;
}
} b[maxn];
void add(int las, int o, int l, int r, int x) {
int mid = (l+r)/2;
if(l == r) v[o] = v[las]+1;
else {
if(x <= mid) {ls[o] = ++tot; rs[o] = rs[las]; add(ls[las], ls[o], l, mid, x);}
else {ls[o] = ls[las]; rs[o] = ++tot; add(rs[las], rs[o], mid+1, r, x);}
v[o] = v[ls[o]] + v[rs[o]];
}
}
int query(int o1, int o2, int l, int r, int k) {
if(l == r) return d[l];
int mid = (l+r)/2, lt = v[ls[o2]]-v[ls[o1]];
if(k > lt) return query(rs[o1], rs[o2], mid+1, r, k-lt);
else return query(ls[o1], ls[o2], l, mid, k);
}
int main() {
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
b[i] = (point){a[i], i};
}
sort(b+1, b+n+1);
for(int i = 1; i <= n; i++) {
c[b[i].rank] = (b[i].val != b[i-1].val || i == 1) ? ++p : p;
d[p] = b[i].val;
}
for(int i =1; i <= n; i++) {
rt[i] = ++tot;
add(rt[i-1], rt[i], 1, n, c[i]);
}
for(int i = 1; i <= m; i++) {
int l, r, k, ans;
scanf("%d%d%d", &l, &r, &k);
printf("%d\n", query(rt[l-1], rt[r], 1, n, k));
}
return 0;
}