CodeForces - 840D Destiny (主席树)

题目链接

题解：

由于每次查询的符合条件的数字不会达到 k 个（k <= 5），所以大胆用主席树暴力往下左右子树都查符合条件的解即可。每次查询时间复杂度O(k*logn)。

代码：

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
#define int ll
#define PI acos(-1.0)
#define INF 0x3f3f3f3f3f3f3f3f
#define P pair<int, int>
#define fastio ios::sync_with_stdio(false), cin.tie(0)
const int mod = 998244353;
const int M = 1000000 + 10;
const int N = 300000 + 10;

int n, m;
struct node {
    int ls, rs, num;
} tree[N<<5];
int rt[N], cnt;

void build(int &now, int l, int r)
{
    now = ++cnt;
    tree[now].num = 0;
    if(l == r) return ;
    int mid = (l + r) >> 1;
    build(tree[now].ls, l, mid);
    build(tree[now].rs, mid + 1, r);
}

void add(int &now, int pre, int val, int l, int r)
{
    now = ++cnt;
    tree[now] = node{tree[pre].ls, tree[pre].rs, tree[pre].num + 1};
    if(l == r) return ;
    int mid = (l + r) >> 1;
    if(val <= mid) add(tree[now].ls, tree[pre].ls, val, l, mid);
    else add(tree[now].rs, tree[pre].rs, val, mid + 1, r);
}

int query(int p, int q, int l, int r, int k)
{
    if(l == r) {
        if(tree[q].num - tree[p].num >= k) return l;
        return -1;
    }
    int mid = (l + r) >> 1, ans = -1;
    int lcnt = tree[tree[q].ls].num - tree[tree[p].ls].num;
    int rcnt = tree[tree[q].rs].num - tree[tree[p].rs].num;
    if(lcnt >= k) ans = query(tree[p].ls, tree[q].ls, l, mid, k);
    if(ans == -1 && rcnt >= k) ans = query(tree[p].rs, tree[q].rs, mid + 1, r, k);
    return ans;
}

signed main()
{
    fastio;
    cin >> n >> m;
    build(rt[0], 1, n);
    for(int i = 1, a; i <= n; i ++) {
        cin >> a;
        add(rt[i], rt[i - 1], a, 1, n);
    }
    for(int i = 1, l, r, k; i <= m; i ++) {
        cin >> l >> r >> k;
        cout << query(rt[l - 1], rt[r], 1, n, (r - l + 1) / k + 1) << endl;
    }

    return 0;
}

/*

  Rejoicing in hope, patient in tribulation.

*/