原理即为用树状数组维护每个主席树的树顶
修改时修改树状数组上的经过的树顶
void update(int &rt, int l, int r, int pos, int val) { //主席树修改
if (!rt) rt = ++tot;
t[rt].sum += val;
if (l == r) return;
int mid = (l + r) >> 1;
if (pos <= mid) update(t[rt].l, l, mid, pos, val);
else update(t[rt].r, m id + 1, r, pos, val);
}
void modify(int pos, int val) { //树状数组修改
int k = getid(a[pos]);
for (int i = pos; i <= n; i += (i & -i)) {
update(root[i], 1, maxn << 1, k, val);
}
}
查询时找出左、右区间需要查询的树顶,处理前缀和判断第k大即可
int query(int l, int r, int k) {
if (l == r) return l;
int res = 0, mid = (l + r) >> 1;
for (int i = 0; i < q1.size(); ++i)
res += t[t[q1[i]].l].sum;
for (int i = 0; i < q2.size(); ++i)
res -= t[t[q2[i]].l].sum;
//控制每个树顶移动
if (res >= k) {
for (int i = 0; i < q1.size(); ++i)
q1[i] = t[q1[i]].l;
for (int i = 0; i < q2.size(); ++i)
q2[i] = t[q2[i]].l;
return query(l, mid, k);
}
else {
for (int i = 0; i < q1.size(); ++i)
q1[i] = t[q1[i]].r;
for (int i = 0; i < q2.size(); ++i)
q2[i] = t[q2[i]].r;
return query(mid + 1, r, k - res);
}
}
int get(int l, int r, int k) { //找出左右区间需要计算的树顶
q1.clear(); q2.clear();
for (int i = r; i; i -= (i & -i))
q1.push_back(root[i]);
for (int i = l - 1; i; i -= (i & -i))
q2.push_back(root[i]);
return query(1, maxn << 1, k);
}
例题:https://www.luogu.org/problem/P2617
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 3;
vector<int> hsh;
int getid(int x) {
return lower_bound(hsh.begin(), hsh.end(), x) - hsh.begin() + 1;
}
int n, m, a[maxn];
vector<int> q1, q2;
struct segTree
{
int tot, root[maxn];
struct node { int l, r, sum; } t[maxn * 200];
segTree() { tot = 0; memset(root, 0, sizeof(root)); }
void update(int &rt, int l, int r, int pos, int val) { //主席树修改
if (!rt) rt = ++tot;
t[rt].sum += val;
if (l == r) return;
int mid = (l + r) >> 1;
if (pos <= mid) update(t[rt].l, l, mid, pos, val);
else update(t[rt].r, m id + 1, r, pos, val);
}
void modify(int pos, int val) { //树状数组修改
int k = getid(a[pos]);
for (int i = pos; i <= n; i += (i & -i)) {
update(root[i], 1, maxn << 1, k, val);
}
}
int query(int l, int r, int k) {
if (l == r) return l;
int res = 0, mid = (l + r) >> 1;
for (int i = 0; i < q1.size(); ++i)
res += t[t[q1[i]].l].sum;
for (int i = 0; i < q2.size(); ++i)
res -= t[t[q2[i]].l].sum;
//控制每个树顶移动
if (res >= k) {
for (int i = 0; i < q1.size(); ++i)
q1[i] = t[q1[i]].l;
for (int i = 0; i < q2.size(); ++i)
q2[i] = t[q2[i]].l;
return query(l, mid, k);
}
else {
for (int i = 0; i < q1.size(); ++i)
q1[i] = t[q1[i]].r;
for (int i = 0; i < q2.size(); ++i)
q2[i] = t[q2[i]].r;
return query(mid + 1, r, k - res);
}
}
int get(int l, int r, int k) { //找出左右区间需要计算的树顶
q1.clear(); q2.clear();
for (int i = r; i; i -= (i & -i))
q1.push_back(root[i]);
for (int i = l - 1; i; i -= (i & -i))
q2.push_back(root[i]);
return query(1, maxn << 1, k);
}
} bitTre;
struct Qnode
{
bool flg;
int l, r, k;
int pos, val;
} q[maxn];
int main()
{
//freopen("in.txt", "r", stdin);
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
hsh.push_back(a[i]);
}
char op[5];
for (int i = 1; i <= m; ++i) {
scanf("%s", op);
if (op[0] == 'Q') {
q[i].flg = false;
scanf("%d%d%d", &q[i].l, &q[i].r, &q[i].k);
}
else {
q[i].flg = true;
scanf("%d%d", &q[i].pos, &q[i].val);
hsh.push_back(q[i].val);
}
}
sort(hsh.begin(), hsh.end());
hsh.erase(unique(hsh.begin(), hsh.end()), hsh.end());
for (int i = 1; i <= n; ++i)
bitTre.modify(i, 1);
for (int i = 1; i <= m; ++i) {
if (!q[i].flg) {
printf("%d\n", hsh[bitTre.get(q[i].l, q[i].r, q[i].k) - 1]);
}
else {
bitTre.modify(q[i].pos, -1);
a[q[i].pos] = q[i].val;
bitTre.modify(q[i].pos, 1);
}
}
}