PAT 甲级 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

这类题第一次遇见，关于模拟栈的问题，似懂非懂。目的：验证某个输出序列到底是不是栈的输入序列。

假设K个数，压入栈的顺序为1，2，..K.给出一个输出序列为a[ ] 。先把输入序列依次压入栈，每次压入数字就先判断是否超过了栈的容量，超出就Break.从输出序列第一个元素开始，设step = 1,判断a[step]与栈顶元素是否相同，若相同，栈顶元素出栈,step++。 当循环结束时,判断栈s是否为空，为空则a[ ] 是输出序列。（也可step为N+1）

#include <bits/stdc++.h>
#define maxn 1010

using namespace std;

int main()
{
    int M,N,K;
    cin>>M>>N>>K;
    int a[N+1]= {0};
    for(int i = 0; i<K; i++)
    {
        stack<int>s;
        for(int j = 1; j<=N; j++)
        {
            cin>>a[j];
        }
        int step = 1;
        for(int k = 1; k<=N; k++)
        {
            s.push(k);
            if(s.size()>M)
            {
                break;
            }
            if(s.top()==a[step])
            {
                while(!s.empty()&&s.top()==a[step])
                {
                    step++;
                    s.pop();
                }
            }
        }
        if(s.empty())
        {
            cout<<"YES"<<endl;
        }
        else
        {
            cout<<"NO"<<endl;
        }
    }
    return 0;
}