1051. Pop Sequence (25)-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

---

　　分析:这道题就是一个给定大小的栈，1,2,3.。。。这样的输进入，然后给你们一串数据，问能否像这样出栈。那就模拟出栈，按顺序输入，每输进去一个就判断是否出栈，如果这是顺序和给定的顺序匹配那就可以，如果不匹配那么栈里的数据会超出上限就是no。

#include <cstdio>
#include <stack>
#include <vector>
using namespace std;
int main ()
{
    int m , n , k;
    scanf_s ("%d %d %d" , &m , &n , &k);
    for (int i = 0; i < k; i++)
    {
        bool flag = false;
        stack<int> s;
        vector<int> v (n + 1);
        for (int j = 1; j <= n; j++)
            scanf_s ("%d" , &v[j]);
        int current = 1;
        for (int j = 1; j <= n; j++)
        {
            s.push (j);
            if (s.size () > m) 
                break;
            //这里就是假设当前的这个值出栈，那么判断一个给出的顺序是不是该它出栈了
            while (!s.empty () && s.top () == v[current])
            {
                s.pop ();
                current++;
            }
        }
        if (current == n + 1) 
            flag = true;
        if (flag) 
            printf ("YES\n");
        else 
            printf ("NO\n");
    }
    return 0;
}