HDU 5915 (二分 主席树)

题目链接：点击这里

题意：给出一个序列，每次询问一个区间$[l,r]$，假设里面有$k$个数字，求第$\lceil k/2 \rceil$个出现的数字的下标.

区间出现的不同数字的个数就是这个题，用主席树写好一套函数以后二分位置每次主席树上query来check一下就好了。

#include <bits/stdc++.h>
using namespace std;
#define maxn 200005
#define maxm maxn*40

struct node {
    int l, r;
    int num;
}tree[maxm];
int T[maxn];
int cnt;
int n, m;
int pre[maxn];
int ans[maxn], a[maxn];

int scan () {
    char ch=' ';
    while(ch<'0'||ch>'9')ch=getchar();
    int x=0;
    while(ch<='9'&&ch>='0')x=x*10+ch-'0',ch=getchar();
    return x;
}

int build_tree (int l, int r) {
    int root = cnt++;
    tree[root].num = 0;
    if (l == r) return root;
    int mid = (l+r)>>1;
    tree[root].l = build_tree (l, mid);
    tree[root].r = build_tree (mid+1, r);
    return root;
}

int update (int root, int pos, int val) {
    int new_root = cnt++, tmp = new_root;
    tree[new_root].num = tree[root].num+val;
    int l = 1, r = n;
    while (l < r) {
        int mid = (l+r)>>1;
        if (pos <= mid) {
            tree[new_root].r = tree[root].r;
            tree[new_root].l = cnt++;
            new_root = tree[new_root].l;
            root = tree[root].l;
            r = mid;
        }
        else {
            tree[new_root].l = tree[root].l;
            tree[new_root].r = cnt++;
            new_root = tree[new_root].r;
            root = tree[root].r;
            l = mid+1;
        }
        tree[new_root].num = tree[root].num+val;
    }
    return tmp;
}

int query (int root, int l, int r, int x, int y) {
    if (x == l && y == r)
        return tree[root].num;
    int mid = (l+r)>>1;
    if (mid >= y) {
        return query (tree[root].l, l, mid, x, y);
    }
    else if (mid < x) {
        return query (tree[root].r, mid+1, r, x, y);
    }
    else
        return query (tree[root].l, l, mid, x, mid) +
                query (tree[root].r, mid+1, r, mid+1, y);
}

int main () {
    int kase;
    scanf ("%d", &kase);
    for (int ii = 1; ii <= kase; ii++) {
        printf ("Case #%d: ", ii);
        cnt = 0;
        n = scan (), m = scan ();
        for (int i = 1; i <= n; i++) a[i] = scan ();
        T[n+1] = build_tree (1, n);
        memset (pre, -1, sizeof pre);
        for (int i = n; i >= 1; i--) {
            if (pre[a[i]] == -1) {
                T[i] = update (T[i+1], i, 1);
                pre[a[i]] = i;
            }
            else {
                int tmp = update (T[i+1], pre[a[i]], -1);
                T[i] = update (tmp, i, 1);
                pre[a[i]] = i;
            }
        }
        int l = 0, r = 0;
        ans[0] = 0;
        for (int i = 1; i <= m; i++) {
            int ll = scan (), rr = scan ();
            l = min ((ll+ans[i-1])%n+1, (rr+ans[i-1])%n+1);
            r = max ((ll+ans[i-1])%n+1, (rr+ans[i-1])%n+1);
            int res = query (T[l], 1, n, l, r), k = (res+1)/2;
            int mid, L = l, R = r;
            while (R-L > 1) {
                mid = (L+R)>>1;
                if (query (T[l], 1, n, l, mid) >= k) R = mid;
                else L = mid;
            }
            if (query (T[l], 1, n, l, R) == k) ans[i] = R;
            else ans[i] = L;
            printf ("%d%c", ans[i], i == m ? '\n' : ' ');
        }
    }
    return 0;
}