bzoj 1012 [JSOI2008]最大数maxnumber

原题链接：http://www.lydsy.com/JudgeOnline/problem.php?id=1012 
线段树，单点更新。。

 #include<algorithm>
 #include<iostream>
 #include<cstdlib>
 #include<cstdio>
 #define lc root<<1
 #define rc root<<1|1
 using std::max;
 const int Max_N = ;
 const int INF = 0x3f3f3f3f;
 int MOD;
 struct Node { int val; };
 struct SegTree {
     Node seg[Max_N << ];
     inline void push_up(int root) {
         seg[root].val = max(seg[lc].val, seg[rc].val);
     }
     inline void update(int root, int l, int r, int pos, int t) {
         if (pos > r || pos < l) return;
         if (pos <= l && pos >= r) {
             seg[root].val += t;
             return;
         }
         int mid = (l + r) >> ;
         update(lc, l, mid, pos, t);
         update(rc, mid + , r, pos, t);
         push_up(root);
     }
     inline int query(int root, int l, int r, int x, int y) {
         if (x > r || y < l) return -INF;
         if (x <= l && y >= r) return seg[root].val;
         int mid = (l + r) >> ;
         int v1 = query(lc, l, mid, x, y);
         int v2 = query(rc, mid + , r, x, y);
         return max(v1, v2);
     }
 }seg;
 int main() {
 #ifdef LOCAL
     freopen("in.txt", "r", stdin);
     freopen("out.txt", "w+", stdout);
 #endif
     char ch;
     int n, v, res, len = ;
     while (~scanf("%d %d", &n, &MOD)) {
         res = ;
         for (int i = ; i < n; i++) {
             getchar();
             scanf("%c %d", &ch, &v);
             if (ch == 'A') ++len, seg.update(, , n, len, (res + v) % MOD);
             else printf("%d\n", res = seg.query(, , n, len - v + , n));
         }
     }
     return ;
 }