Acwing1275-最大数(线段树)

输入测试样例:
10 100
A 97
Q 1
Q 1
A 17
Q 2 
A 63
Q 1
Q 1
Q 3
A 99

AC代码:

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <string>
using namespace std;
const int N = 200010;
struct Node {
	int  l, r;
	int v;//区间[l,r]之间的最大值
}tr[N * 4];

//建树
void build(int u, int l, int r) {
	tr[u] = { l,r };
	if (l == r) return;
	int mid = l + r >> 1;
	build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
}
void pushup(int u) {//由子节点的信息，来计算父节点的信息
	tr[u].v = max(tr[u << 1].v, tr[u << 1 | 1].v);
}

int query(int u, int l, int r) {
	if (tr[u].l >= l && tr[u].r <= r) {//树中节点，已经被完全包含在[l,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 v) {
	if (tr[u].l == x && tr[u].r == x) tr[u].v = v;//当前节点为叶子节点
	else {
		int mid = tr[u].l + tr[u].r >> 1;
		if (x <= mid) modify(u << 1, x, v);
		else modify(u << 1 | 1, x, v);
		pushup(u);
	}
}

int main()
{
	int n = 0, last = 0;//n表示当前数据个数,last表示上一次查询的数
	int m, p;
	scanf("%d%d", &m, &p);
	build(1, 1, m);
	int x;
	string s;
	while (m--) {
		cin >> s;
		scanf("%d", &x);
		if (s == "Q") {
			last = query(1, n - x + 1, n);
			printf("%d\n", last);
		}
		else {
			modify(1, n + 1, (last + x) % p);
			n++;
		}
	}



	system("pause");
	return 0;
}
/*
输入样例:
10 100
A 97
Q 1
Q 1
A 17
Q 2 
A 63
Q 1
Q 1
Q 3
A 99
*/