今日休息+划水

三道DP +一道没有pushup的线段树模板，明天物理小测，水一天

单点修改，区间查询最大值

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

const int N = 200010;
typedef long long LL;

struct node {
	int l, r, v;
};
node tr[N * 4];
int m, n, p;

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 = l, tr[u].r = 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 modify(int u, int x, int c) {
	if (tr[u].l == x && tr[u].r == x)
		tr[u].v = c;
	else {
		int mid = tr[u].l + tr[u].r >> 1;
		if (x <= mid)
			modify(u << 1, x, c);
		else
			modify(u << 1 | 1, x, c);
		pushup(u);
	}

}

int main() {
	cin >> m >> p;
	build(1, 1, m);

	int last = 0;
	while (m--) {
		string s;
		int L;
		cin >> s >> L;
		if (s == "Q") {
			last = query(1, n - L + 1, n);
			cout << last << endl;
		} else {
			//cout << L << endl;
			modify(1, n + 1, ((LL)last + L) % p);
			n++;
		}
	}

}