【JSOI 2008】 最大数

【题目链接】

点击打开链接

【算法】

很明显，我们可以用线段树解决此题

只需维护区间最值就可以了

【代码】

#include<bits/stdc++.h>
using namespace std;
#define MAXM 200000

int M,D,x,l,lastans,len;
int Max[MAXM*];
char opt;

template <typename T> inline void read(T &x) {
        int f = ; x = ;
        char c = getchar();
        for (; !isdigit(c); c = getchar()) { if (c == '-') f = -f; }
        for (; isdigit(c); c = getchar()) x = (x << ) + (x << ) + c - '';
        x *= f;
}
template <typename T> inline void write(T x) {
    if (x < ) { putchar('-'); x = -x; }
    if (x > ) write(x/);
    putchar(x%+'');
}
template <typename T> inline void writeln(T x) {
    write(x);
    puts("");
}
inline void push_up(int index) {
        Max[index] = max(Max[index<<],Max[index<<|]);
}
inline int query_max(int index,int l,int r,int ql,int qr) {
        int mid;
        if (l == ql && r == qr) return Max[index];
        else {
                mid = (l + r) >> ;
                if (mid >= qr) return query_max(index<<,l,mid,ql,qr);
                else if (mid +  <= ql) return query_max(index<<|,mid+,r,ql,qr);
                else return max(query_max(index<<,l,mid,ql,mid),query_max(index<<|,mid+,r,mid+,qr));
        }
}
inline void ins(int index,int l,int r,int pos,int val) {
        int mid;
        if     (l == r) {
                Max[index] = val;
                return;
        }
        mid = (l + r) >> ;
        if (mid >= pos) ins(index<<,l,mid,pos,val);
        else ins(index<<|,mid+,r,pos,val);
        push_up(index);
}

int main() {

        read(M); read(D);

        while (M--) {
                opt = getchar();
                if (opt == 'Q') {
                        read(l);
                        writeln(lastans = query_max(,,MAXM,len-l+,len));
                } else {
                        read(x);
                        x = (x + lastans) % D;
                        ins(,,MAXM,++len,x);
                }
        }

        return ;

}