en a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of the stack. For example, if M is 5 and N is 7, we can obtain 1, 2, 3, 4, 5, 6, 7 from the stack, but not 3, 2, 1, 7, 5, 6, 4.
Input Specification:
Each input file contains one test case. For each case, the first line contains 3 numbers (all no more than 1000): M (the maximum capacity of the stack), N (the length of push sequence), and K (the number of pop sequences to be checked). Then K lines follow, each contains a pop sequence of N numbers. All the numbers in a line are separated by a space.
Output Specification:
For each pop sequence, print in one line "YES" if it is indeed a possible pop sequence of the stack, or "NO" if not.
Sample Input:
5 7 5
1 2 3 4 5 6 7
3 2 1 7 5 6 4
7 6 5 4 3 2 1
5 6 4 3 7 2 1
1 7 6 5 4 3 2
Sample Output:
YES
NO
NO
YES
NO
判断一个序列是否可以通过1,2,3,-N出栈得到,使用模拟的方法。代码
#include <iostream>
#include <vector>
#include <stack>
int main() {
int m, n, k, x;
std::cin >> m >> n >> k;
while (k--) {
std::vector<int> arr;
for (int i = 0; i < n; i++) {
std::cin >> x;
arr.push_back(x);
}
std::stack<int> s;
int pos = 0;
for (int i = 1; i <= n; ++i) {
// 如果栈满
if (s.size() == m) {
break;
}
// 如果当前arr[pos]恰好等于i
// 不用入栈,直接跳下一个
if (arr[pos] == i) {
pos++;
while (!s.empty()) {
if (arr[pos] == s.top()) {
pos++;
s.pop();
}
else break;
}
}
else
s.push(i);
}
if (s.empty() == 1) {
std::cout << "YES" << std::endl;
}
else std::cout << "NO" << std::endl;
}
return 0;
}