PAT 甲级 1051 Pop Sequence

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-N入栈，如果当前的值与数组当前值a[start]相等则出栈，循环判断下一值，如果栈的大小超过了M，则输出不符合要求。

代码：

#include<cstdio>
#include<stack>
using namespace std;
int main(void)
{
	int M,N,K,start;
	int a[2000];
	stack<int> st;
	scanf("%d %d %d",&M,&N,&K);
	while(K--)
	{
		while(!st.empty())
			st.pop();
		start = 1;
		for(int i = 1;i <= N;i++)
			scanf("%d",&a[i]);
		for(int i = 1;i <= N;i++)
		{
			st.push(i);	
			if(st.size()>M)
				break;
			while(st.size()>0&&st.top()==a[start])
			{
				start++;
				st.pop();
			}
		}
		if(start == N + 1)
			printf("YES\n");
		else
			printf("NO\n") ;
	}
	return 0;
}

注意:while(st.size()>0&&st.top()==a[start])这里st.size()要写在前面，判断栈的大小是否为0。