【HDU6278】Just h-index 主席树 + 二分

传送⻔

题意

给n个数，q次询问，每次询问给出一个区间[l,r]，要你求出最大的h，使得在[l,r]这个区间内满足，有h个数的值大于等于h。

分析

求最大的符合要求的数，首先想到二分的思路
然后因为处理区间内的个数问题，可以在主席树上处理
因为主席树自带一个二分，所以可以去掉一个$log$

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int a[N];
struct Node{
    int l,r;
    int num;
}tr[N * 50];
int root[N],idx;
int n,m;

int build(int l,int r){
    int p = ++idx;
    tr[p].num = 0;
    if(l == r) return p;
    int mid = (l + r) >> 1;
    tr[p].l = build(l,mid),tr[p].r= build(mid + 1,r);
    return p;
}

int insert(int p,int l,int r,int x){
    int q = ++idx;
    tr[q] = tr[p];
    if(l == r){
        tr[q].num++;
        return q;
    }
    int mid = (l + r) >> 1;
    if(x <= mid) tr[q].l = insert(tr[p].l,l,mid,x);
    else tr[q].r = insert(tr[p].r,mid + 1,r,x);
    tr[q].num = tr[tr[q].l].num + tr[tr[q].r].num;
    return q;
}

int query(int p,int q,int l,int r,int x){
    if(l == r) return l;
    int mid = (l + r) >> 1;
    int sum = tr[tr[q].r].num - tr[tr[p].r].num;
    if(sum + x > mid) return query(tr[p].r,tr[q].r,mid + 1,r,x);
    return query(tr[p].l,tr[q].l,l,mid,x + sum);
}

int main() {
    while(~scanf("%d%d",&n,&m)){
        memset(tr,0,sizeof tr);
        for(int i = 1;i <= n;i++) scanf("%d",&a[i]);
        idx = 0;
        root[0] = build(1,n);
        for(int i = 1;i <= n;i++) root[i] = insert(root[i - 1],1,n,a[i]);
        int l = 0,r = n;
        while(m--){
            int l,r;
            read(l),read(r);
            di(query(root[l - 1],root[r],1,n,0));
        }
    }
    return 0;
}