PAT A1051(栈）

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

如果出现段错误说明在top（）和pop（）前没有保证栈非空。

#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<stack>
#include<vector>

using namespace std;


stack<int> S;//用于模拟实际栈的情况 

int M=1,N=1,K=1;
int arr[1004];//保存输入的序列 

bool check(){//核心代码 ：判断是否为合法序列 
		int top=1;
		
	 for(int i=1;i<=N;i++){//i代表arr[]的位置。 
	 if(S.empty()==1)S.push(top++);
	 	while(S.top()!=arr[i])
	 	{S.push(top++); 
	 	if(S.size()>M)
	 			return 0;
		 }
		S.pop();
		if(i==N && S.empty()==1)return 1;		 
	 	 
	 } 
}


 int main(){
	
	scanf("%d%d%d",&M,&N,&K);
	
	while(K--){//loop for K times
		
		while(!S.empty())  //empty Stack 
		S.pop();

		for(int i=1;i<=N;i++){//input data 
			
			scanf("%d",&arr[i]);
		}
		if(check()==true)
		printf("YES\n");
		else printf("NO\n");
		
	}
	return 0;
}