[AcWing 1275] 最大数

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;

const int N = 2e5 + 10;

int m, p;

struct Node
{
    int l, r;
    int v;
} tr[N * 4];

void pushup(int u)
{
    tr[u].v = max(tr[u << 1].v, tr[u << 1 | 1].v);
}

void build(int u, int l, int r)
{
    tr[u] = {l, r};
    if (l == r)
        return;
    int mid = l + r >> 1;
    build(u << 1, l, mid);
    build(u << 1 | 1, mid + 1, r);
}

int query(int u, int l, int r)
{
    if (tr[u].l >= l && tr[u].r <= r)
        return tr[u].v;
    int mid = tr[u].l + tr[u].r >> 1;
    int v = 0;
    if (l <= mid)
        v = query(u << 1, l, r);
    if (r > mid)
        v = max(v, query(u << 1 | 1, l, r));
    return v;
}

void update(int u, int x, int v)
{
    if (tr[u].l == tr[u].r) {
        tr[u].v = v;
        return;
    }
    int mid = tr[u].l + tr[u].r >> 1;
    if (x <= mid)
        update(u << 1, x, v);
    else
        update(u << 1 | 1, x, v);
    pushup(u);
}

void solve()
{
    cin >> m >> p;
    build(1, 1, m);
    int n = 0, last = 0;
    while (m --) {
        char op;
        int x;
        cin >> op >> x;
        if (op == 'Q') {
            last = query(1, n - x + 1, n);
            cout << last << endl;
        }
        else {
            ++ n;
            update(1, n, (1LL * last + x) % p);
        }
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    solve();

    return 0;
}