PAT A1051. 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

	#include <cstdio>
	#include <iostream>
	#include <algorithm>
	#include <cstring>
	#include <stack>
	#define Max 1111
	using namespace std;
	stack<int> p;
	int main()
	{
		int S[Max];
		int k,m,n;
		scanf("%d%d%d",&k,&m,&n);
		for(int i=0;i<n;i++)
		{
			bool f =true;
			int x=1;
			while(!p.empty())
			{
				p.pop();
			}
			for(int j=1;j<=m;j++)
			{
				scanf("%d",&S[j]);
			}
			for(int j=1;j<=m;j++)
			{
				p.push(j);
				if(p.size()>k)
				{
					f=false;
					break;
				}
				while(!p.empty()&&p.top()==S[x])
				{
					p.pop();
					x++;
				}
			
			}
			if(p.empty()==true&&f==true)
			{
				printf("YES\n");

			}
			else  printf("NO\n");
		}
		system("pause");
		return 0;
	}