P3567 [POI2014] 主席树

题意

传送门 P3567 [POI2014]KUR-Couriers

题解

主席树查询出现个数严格大于查询区间一半的数字即可。

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
#define maxn 500005
#define tree_size 10000005
int N, M, A[maxn];
int cnt, sum[tree_size], rt[maxn], cl[tree_size], cr[tree_size];

int update(int pre, int x, int l, int r)
{
    int cur = ++cnt;
    cl[cur] = cl[pre], cr[cur] = cr[pre], sum[cur] = sum[pre] + 1;
    if (r - l > 1)
    {
        int m = (l + r) >> 1;
        x < m ? cl[cur] = update(cl[pre], x, l, m) : cr[cur] = update(cr[pre], x, m, r);
    }
    return cur;
}

int query(int u, int v, int n, int l, int r)
{
    if (r - l == 1)
        return l;
    int n1 = sum[cl[v]] - sum[cl[u]], n2 = sum[cr[v]] - sum[cr[u]], m = (l + r) >> 1;
    if (n1 > n)
        return query(cl[u], cl[v], n, l, m);
    if (n2 > n)
        return query(cr[u], cr[v], n, m, r);
    return 0;
}
int main()
{
    scanf("%d%d", &N, &M);
    for (int i = 0; i < N; ++i)
        scanf("%d", A + i);
    int n = N + 1;
    for (int i = 0; i < N; ++i)
        rt[i + 1] = update(rt[i], A[i], 0, n);
    while (M--)
    {
        int l, r;
        scanf("%d%d", &l, &r);
        printf("%d\n", query(rt[l - 1], rt[r], (r - l + 1) >> 1, 0, n));
    }
    return 0;
}