PAT - 甲级 - 1051. Pop Sequence (25)(模拟)

Given 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.结果数列

要求：
1.结果数列是否能通过一系列入栈出栈操作形成

求解：
1.模拟过程
2.按照给定顺序入栈
3.如果栈定元素与结果数列相同，则出栈

---

#include <cstdio>
#include <stack>
using namespace std;

int m, n, k;
int order[1010];
stack<int> s;

int main() {
	scanf("%d%d%d", &m, &n, &k);
	for(int i = 0; i < k; i++) {
		for(int j = 0; j < n; j++) {
			scanf("%d", &order[j]);	
		}
		while(!s.empty()) s.pop();
		int id = 0;
		for(int j = 1; j <= n; j++) {
			s.push(j);
			if(s.size() > m)
				break;
			while(!s.empty() && s.top() == order[id]){
				s.pop();
				id++;
			}
		}
		if(id == n) {
			printf("YES\n");
		} else {
			printf("NO\n");
		}
	}


	return 0;
}

---