(模板）线段树（单点更新，单点求值）

最主要的区别就是不用lazytab了，所以不需要pushdown了，不过还是跟复杂版的有所区别的…小心对待
（原题是洛谷P1198，数据加强以后要记得特判数列为空的情形）

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 200001;
int m, d, len = 0;
ll array1[maxn], t = 0, sum[maxn << 2];
void buildtree(int node, int begin, int end)
{
    if (begin == end) {
        sum[node] = array1[begin];
        return;
    }
    int m = (begin + end) >> 1;
    buildtree(node << 1, begin, m);
    buildtree(node << 1 | 1, m + 1, end);
    sum[node] = max(sum[node << 1], sum[node << 1 | 1]);
}
void update(int node, int ind, int change, int begin, int end)
{
    if (begin == end) {
        sum[node] = change;
        return;
    }
    int m = (begin + end) >> 1;
    if (ind <= m)
        update(node << 1, ind, change, begin, m);
    else
        update(node << 1 | 1, ind, change, m + 1, end);
    sum[node] = max(sum[node << 1], sum[node << 1 | 1]);
}
ll query(int node, int begin, int end, int left, int right)
{
    if (left <= begin&&right >= end)
        return sum[node];
    int m = (begin + end) >> 1;
    ll p1 = 0, p2 = 0;
    if (left <= m)
        p1 = query(node << 1, begin, m, left, right);
    if (right > m)
        p2 = query(node << 1 | 1, m + 1, end, left, right);
    return max(p1, p2);
}
int main(void)
{
    cin >> m >> d;

    buildtree(1, 1, m);
    for (int i = 1; i <= m; i++) {
        char a; ll n;
        cin >> a >> n;
        if (a == 'Q') {
            t = query(1, 1, m, len - n + 1, len);
            printf("%lld\n", t);
        }
        else {
            ll temp = (n + t) % d;
            array1[++len] = temp;
            update(1, len, temp, 1, m);
        }
    }

    return 0;
}