bzoj 1012 BST 支持插入，区间最大

水。。。

 /**************************************************************
     Problem: 1012
     User: idy002
     Language: C++
     Result: Accepted
     Time:1372 ms
     Memory:5960 kb
 ****************************************************************/

 #include <cstdio>
 #include <iostream>
 #define fprintf(...)
 #define oo 0x3f3f3f3f
 #define maxn 200010
 using namespace std;

 namespace S {
     int pre[maxn], son[maxn][], siz[maxn], val[maxn], mv[maxn], root, ntot;

     void update( int nd ) {
         siz[nd] = siz[son[nd][]]+siz[son[nd][]]+;
         mv[nd] = max( val[nd], max( mv[son[nd][]], mv[son[nd][]] ) );
     }
     void rotate( int nd, int d ) {
         int p = pre[nd];
         int s = son[nd][!d];
         int ss = son[s][d];

         son[nd][!d] = ss;
         son[s][d] = nd;
         if( p ) son[p][ nd==son[p][] ] = s;
         else root = s;

         pre[s] = p;
         pre[nd] = s;
         if( ss ) pre[ss] = nd;

         update( nd );
         update( s );
     }
     void splay( int nd, int top= ) {
         while( pre[nd]!=top ) {
             int p = pre[nd];
             int nl = nd==son[p][];
             if( pre[p]==top ) {
                 rotate( p, nl );
             } else {
                 int pp = pre[p];
                 int pl = p==son[pp][];
                 if( nl==pl ) {
                     rotate( pp, pl );
                     rotate( p, nl );
                 } else {
                     rotate( p, nl );
                     rotate( pp, pl );
                 }
             }
         }
     }
     int newnode( int p, int v ) {
         int nd = ++ntot;
         pre[nd] = p;
         son[nd][] = son[nd][] = ;
         siz[nd] = ;
         mv[nd] = val[nd] = v;
         return nd;
     }
     int find( int pos ) {
         int nd = root;
         while(  ) {
             int ls = siz[son[nd][]];
             if( pos<=ls ) {
                 nd = son[nd][];
             } else if( pos>=ls+ ) {
                 nd = son[nd][];
                 pos -= ls+;
             } else return nd;
         }
     }
     void init() {
         root = ntot = ;
         val[] = mv[] = -oo;
     }
     void add_val( int v ) {
         fprintf( stderr, "add_val( %d )\n", v );
         if( !root ) {
             root = newnode( , v );
             return;
         }
         int nd = root;
         while( son[nd][] ) nd=son[nd][];
         son[nd][] = newnode( nd, v );
         splay( son[nd][] );
     }
     int qu_max( int pos ) {
         fprintf( stderr, "qu_max( %d )\n", pos );
         int nd = find(pos);
         splay( nd );
         return max( val[nd], mv[son[nd][]] );
     }
 };

 int main() {
     int T, mod;
     int lastans = ;

     scanf( "%d%d", &T, &mod );
     S::init();
     while( T-- ) {
         char opt[];
         int v;
         scanf( "%s%d", opt, &v );
         if( opt[]=='A' ) {
             v += lastans;
             v %= mod;
             S::add_val( v );
         } else {
             printf( "%d\n", lastans=S::qu_max( S::siz[S::root]-v+ ) );
         }
     }
 }