[JSOI2008]最大数maxnumber

想到冗余就差不多了 单调队列

#include <cstdio>
const int N = 501000;
int q[N], loc[N], h, t, n, d, len;
inline void INSERT (int x)
{
    while (h <= t && q[t] < x) t --;
    q[++ t] = x;loc[t] = ++ len;
}
inline int QUERY (int x)
{
    int st = 0, ed = t + 1, mid;
    while (st < ed - 1)
    {
        mid = st + ed >> 1;
        if (loc[mid] < x) st = mid;
        else ed = mid;
    }
    return q[st + 1];
}
int main ()
{h = 1;
    scanf ("%d%d", &n, &d);char s[10];
    for (int i = 1, ans = 0, x; i <= n; i ++)
    {
        scanf ("%s%d", s, &x);
        if (s[0] == 'Q')
            printf ("%d\n", ans = QUERY (len - x + 1));
        if (s[0] == 'A')
            INSERT (((long long )x + ans) % d);
    }
    return 0;
}