0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-24 18:52:02 +00:00

P1198 [JSOI2008]最大数

R42912514
This commit is contained in:
Baoshuo Ren 2020-11-30 19:22:56 +08:00 committed by Baoshuo Ren
parent 6c1e404b76
commit 41e5ac636c
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

40
problem/P1198/P1198.cpp Normal file
View File

@ -0,0 +1,40 @@
#include <bits/stdc++.h>
using namespace std;
long long t, d, a[200005], f[200005][25];
int n, m, x;
char op;
bool flag;
void change(int u) {
f[u][0] = a[u];
for (int i = 1; u - (1 << i) >= 0; i++) {
f[u][i] = max(f[u][i - 1], f[u - (1 << (i - 1))][i - 1]);
}
}
long long find(int x, int y) {
int d = (int)(log(y - x + 1) / log(2));
return max(f[y][d], f[x + (1 << d) - 1][d]);
}
int main() {
cin >> m >> d;
while (m--) {
cin >> op >> x;
if (op == 'A') {
a[++n] = (x + t) % d;
change(n);
}
else if (op == 'Q') {
if (x == 1) {
cout << (t = a[n]) << endl;
}
else {
cout << (t = find(n - x + 1, n)) << endl;
}
}
}
return 0;
}