分析
一、 离散化
int getId(int x) {
return lower_bound(v.begin(), v.end(), x) - v.begin() + 1;
}
for (int i = 1; i <= n; i++) {
sc(a[i]);
v.push_back(a[i]);
}
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
定义结构体
一般要开40倍
struct Node {
int l, r, sum;
} A[maxn * 40];
插入
主席树不需要建树,只需要一边读入一边插入即可
void insert(int l, int r, int pre, int &now, int pos) {
A[++cnt] = A[pre];
A[cnt].sum++;
now = cnt;
if (l == r) return;
int mid = (l + r) >> 1;
if (pos <= mid) insert(l, mid, A[pre].l, A[now].l, pos);
else insert(mid + 1, r, A[pre].r, A[now].r, pos);
}
for (int i = 1; i <= n; i++)
insert(1, n, root[i - 1], root[i], getId(a[i]));
查询
查询区间[x,y]的第k大
int query(int l, int r, int L, int R, int k) {
if (l == r) return l;
int mid = m(l, r);
int tmp = A[A[R].l].sum - A[A[L].l].sum;
if (k <= tmp) return query(l, mid, A[L].l, A[R].l, k);
else return query(mid + 1, r, A[L].r, A[R].r, k - tmp);
}
for (int i = 1; i <= m; i++) {
scanf("%d%d%d", &x, &y, &k);
printf("%d\n", v[query(1, n, root[x - 1], root[y], k) - 1]);
}
##全部代码
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<string>
#include<string.h>
#include<algorithm>
#include <vector>
using namespace std;
#define ll long long
#define sc(x) scanf("%d",&x)
#define scc(x, y) scanf("%d%d",&x,&y)
#define p(x) printf("%d\n",x)
#define m(x, y) (x+y)>>1
#define l(x) x<<1
#define r(x) x<<1|1
const int maxn = 2e5 + 6;
//root[]储存第n棵树的根节点的序号(对应于A[])
int n, m, cnt, x, y, k, a[maxn], root[maxn];
vector<int> v;
struct Node {
int l, r, sum;
} A[maxn * 40];
int getId(int n) {
return lower_bound(v.begin(), v.end(), n) - v.begin() + 1;
}
void insert(int l, int r, int pre, int &now, int pos) {
A[++cnt] = A[pre];
A[cnt].sum++;
now = cnt;
if (l == r) return;
int mid = (l + r) >> 1;
if (pos <= mid) insert(l, mid, A[pre].l, A[now].l, pos);
else insert(mid + 1, r, A[pre].r, A[now].r, pos);
}
int query(int l, int r, int L, int R, int k) {
if (l == r) return l;
int mid = m(l, r);
int tmp = A[A[R].l].sum - A[A[L].l].sum;
if (k <= tmp) return query(l, mid, A[L].l, A[R].l, k);
else return query(mid + 1, r, A[L].r, A[R].r, k - tmp);
}
int main() {
scc(n, m);
for (int i = 1; i <= n; i++) {
sc(a[i]);
v.push_back(a[i]);
}
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
for (int i = 1; i <= n; i++)
insert(1, n, root[i - 1], root[i], getId(a[i]));
for (int i = 1; i <= m; i++) {
scanf("%d%d%d", &x, &y, &k);
printf("%d\n", v[query(1, n, root[x - 1], root[y], k) - 1]);
}
return 0;
}