数列维护：查询最大值和插入操作 - C++ 代码实现

#include "iostream"\n#include "vector"\n#include "algorithm"\n\nusing namespace std;
\nint main() {
int M, D;
cin >> M >> D;
\n vector sequence;
int lastQuery = 0;
\n for (int i = 0; i < M; i++) {
string operation;
cin >> operation;
\n if (operation == "Q") {
int L;
cin >> L;
\n int start = max(0, (int)sequence.size() - L);
int maxNum = *max_element(sequence.begin() + start, sequence.end());
cout << maxNum << endl;
} else if (operation == "A") {
int n;
cin >> n;
\n lastQuery = (lastQuery + n) % D;
sequence.push_back(lastQuery);
}
}
\n return 0;
}