【通过PAT复习C++与数据结构】PAT-A 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.

输入描述:
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.

输出描述:
For each pop sequence, print in one line “YES” if it is indeed a possible pop sequence of the stack, or “NO” if not.
示例1
输入
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
输出
YES
NO
NO
YES
NO

代码

#include<iostream>

using namespace std;
int main(){
	int M,N,K;
	cin>>M>>N>>K;
	int top=-1;
	int num[M];
	for(int i=0;i<K;++i){
		top=-1;
		int input[N];//输出队列 
		int p=0;//p是输出队列当前等待出栈元素 
		for(int j=0;j<N;++j)cin>>input[j];
		bool flag=1;
		for(int j=1;j<=N;++j){
			if(top==M){
				flag=0;
				break;
			}
			++top;
			num[top]=j;
			while(num[top]==input[p]&&top>-1){
				top--;
				p++;
			}
		}
		if(top==-1&&flag==1)cout<<"YES"<<endl;
		else cout<<"NO"<<endl;
	}
}