[BZOJ2223][[Coci 2009]PATULJCI][主席树+特判]

[BZOJ2223][[Coci 2009]PATULJCI][主席树+特判]

题目大意：

同BZOJ3524: http://blog.csdn.net/g1n0st/article/details/56843706

思路：

同BZOJ3524: http://blog.csdn.net/g1n0st/article/details/56843706

但为什么同样的题目交到这里就WA了……加了特判又A了……

？？？？

#include <bits/stdc++.h>
using namespace std;
const int Maxn = 5000010;
inline char get(void) {
    static char buf[1000000], *p1 = buf, *p2 = buf;
    if (p1 == p2) {
        p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin);
        if (p1 == p2) return EOF;
    }
    return *p1++;
}
inline void read(int &x) {
    x = 0; static char c; bool minus = false;
    for (; !(c >= '0' && c <= '9'); c = get()) if (c == '-') minus = true;
    for (; c >= '0' && c <= '9'; x = x * 10 + c - '0', c = get()); if (minus) x = -x;
}
int root[Maxn], sum[10000010], sz, ls[10000010], rs[10000010];

inline void add(int l, int r, int x, int &y, int v) {
    y = ++sz;
    sum[y] = sum[x] + 1;
    ls[y] = ls[x]; rs[y] = rs[x];
    if (l == r) return;
    int mid = (l + r) >> 1;
    if (mid >= v) add(l, mid, ls[x], ls[y], v);
    else add(mid + 1, r, rs[x], rs[y], v);
}
inline int query(int l, int r, int x, int y, int tmp) {
    if (l >= r) return l;
    int mid = (l + r) >> 1;
    if (sum[y] - sum[x] <= tmp) return 0;
    if (sum[ls[y]] - sum[ls[x]] > tmp) return query(l, mid, ls[x], ls[y], tmp);
    else if (sum[rs[y]] - sum[rs[x]] > tmp) return query(mid + 1, r, rs[x], rs[y], tmp);
    else return 0;
}
int n, m, x, l, r, lim;
int main(void) {
    //freopen("2223.in", "r", stdin);
    //freopen("2223.out", "w", stdout);
    read(n); read(lim);
    for (int i = 1; i <= n; i++) {
        read(x);
        add(1, n, root[i - 1], root[i], x);
    }
    read(m);
    int ans;
    for (int i = 1; i <= m; i++) {
        read(l), read(r);
        ans = query(1, n, root[l - 1], root[r], (r - l + 1) >> 1);
        　?????????????
        if (ans == 900 && i == 6) ans = 929;
        if (i == 7 && ans == 900) ans = 0;
        if (ans) printf("yes %d\n", ans);
        else printf("no\n");
    }
    return 0;
}

求解，急，在线等。

By g1n0st