2019牛客国庆集训派对day2 C Just h-index 二分答案+主席树

原题链接：https://ac.nowcoder.com/acm/contest/1107/C

题意

有一个序列$[a1...an]$，每次询问一个区间$[l,r]$，求一个值h使得区间内大于等于h的值个数不得少于h个

分析

根据题意，值h完全符合单调性，当h增大时，大于等于h的个数会减少，否则个数增加。那么就可以直接上二分答案了，然后考虑如何去找。由于值非常小，所以可以对每个权值建一颗树，然后这棵树上保存的点为权值小于i的点，这样我们就可以先对原序列排个序，记住原位置，然后一个一个加到主席树上，主席树基于权值的每个版本都是累加的状态，所以符合要求。

Code

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define re register
typedef long long ll;
typedef pair<int, int> PII;
typedef unsigned long long ull;
const int N = 2e5 + 10, M = 1e6 + 5, INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int sum[N*50], ls[N*50], rs[N*50], rt[N*50], cnt;
void modify(int &now, int pre, int l, int r, int pos, int val) {
    now = ++cnt;
    sum[now] = sum[pre] + val, ls[now] = ls[pre], rs[now] = rs[pre];
    if (l == r) return;
    int mid = (l + r) >> 1;
    if (pos <= mid) modify(ls[now], ls[pre], l, mid, pos, val);
    else modify(rs[now], rs[pre], mid+1, r, pos, val);
}
int query(int now, int l, int r, int ql, int qr) {
    if (ql <= l && qr >= r) return sum[now];
    int mid = (l + r) >> 1;
    int ans = 0;
    if (ql <= mid) ans += query(ls[now], l, mid, ql, qr);
    if (qr > mid) ans += query(rs[now], mid+1, r, ql, qr);
    return ans;
}
struct node {
    int x, id;
    bool operator < (const node &rhs) const {
        return x < rhs.x;
    }
}a[N];
void solve() {
    int n, m;
    while (cin >> n >> m) {
        cnt = 0;
        for (int i = 1; i <= n; i++) cin >> a[i].x, a[i].id = i;
        sort(a+1, a+n+1);
        int tot = 1;
        for (int i = 1; i <= n+1; i++) {
            rt[i] = rt[i - 1];
            while (a[tot].x == i - 1 && tot <= n) modify(rt[i], rt[i], 1, n, a[tot].id, 1), tot++;
        }
        while (m--) {
            int l, r; cin >> l >> r;
            int L = 1, R = n+1;
            while (L <= R) {
                int mid = (L + R) >> 1;
                if ((r-l+1) - query(rt[mid], 1, n, l, r) >= mid) L = mid + 1;
                else R = mid - 1;
            }
            cout << R << endl;
        }
        for (int i = 1; i <= cnt; i++) ls[i] = rs[i] = sum[i] = rt[i] = 0;
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
#endif
    solve();
    return 0;
}