合法出入栈——PTA——02-线性结构4 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

这道题与UVa514的火车出入相比，多了一个东西，也就是栈的容量有限，那么我们要在是否还有元素可以加入栈的基础上加上判断栈是否已经满了

#include <iostream>
#include  <stack>
#include <string.h>
#include <cstring>
#include <cstdio>
using namespace std;
const int MAXN = 10000;
int main()
{
	stack<int>s;
	int n,m,k;
	cin>>m>>n>>k;		
  int a[MAXN];

	for(int j=1; j<= k;j++)
	{

		int t=1;
		int h=1;
		int ans=1;
		while(!s.empty())
			s.pop();


		for(int i=1 ; i<= n ;i++)
			cin>>a[i];

        while(h<=n)
        {
            if(!s.empty()&&a[h]==s.top())
                {
                    h++;
                    s.pop();
                }

            else if(t<=n&&s.size()<m)
            {
                s.push(t);
                t++;
            }
            else
                {
                    ans = 0;
                    break;
                }
        }



  
		if(!ans)
			printf("NO\n");
		else
			printf("YES\n");
	}


	//system("PAUSE");
	return 0;
}