PTA_7-1 Pop Sequence（25 分）_给指定的序列压栈,可以随时出栈,问你出栈顺序是否正确

7-1 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 51 2 3 4 5 6 73 2 1 7 5 6 47 6 5 4 3 2 15 6 4 3 7 2 11 7 6 5 4 3 2Sample Output:YESNONOYESNO

#include<iostream>#include<cstdio>#include<cstring>#include<stack>using namespace std;int main(){    int n, m, i, j, k;    while (cin >> m >> n >> k)    {        while (k--)        {            int num[1111];            for (i =0 ; i < n; i++)                scanf("%d", num + i);            stack<int> q;            int cnt = 0;            for (i = 1; i <= n; i++)            {                q.push(i);                if (q.size() > m) break;                while(!q.empty() && q.top() == num[cnt])                {                    q.pop();                    cnt++;                }            }            if (cnt == n)                puts("YES");            else                puts("NO");        }     }    return 0;}