PTA-stack(1051)

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

思路

这道题是考察stack的基础题，我们在学习数据结构时经常做这种选择题，给一个出栈序列判断其是否合法，这道题就是模拟这个过程。
通过挨个入栈操作，不断检查栈顶与出栈序列的元素是否相同，如果相同则出栈并向后移动出栈序列元素，在过程中需要判断栈是否为空！
模拟后如果栈为空则说明序列合法，否则序列不合法。
在每次操作后都要清空栈，以免影响下一次操作。

#include<bits/stdc++.h>
using namespace std;
stack<int> st;
vector<int> ans(1001);
int main() {
	int n,m,k;
	cin>>n>>m>>k;
	while(k--) {
		bool pan=false;
		while(!st.empty()) {
			st.pop();
		}
		for(int i=0; i<m; i++) {
			cin>>ans[i];
		}
		int cur=0;
		for(int j=0; j<m; j++) {
			st.push(j+1);
			if(st.size()>n) {
				pan=false;
				break;
			}
			while(st.size()&&ans[cur]==st.top()){
				cur++;
				st.pop();
			}
		}
		if(!st.empty()) pan=false;
		else pan=true;
		if(pan) cout<<"YES"<<endl;
		else cout<<"NO"<<endl;
	}
	return 0;
}