【剑指紫金港】1051 Pop Sequence 栈模拟

A 1051 Pop Sequence

题目链接

Problem Description

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

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

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

AC代码

#include<bits/stdc++.h>
using namespace std;

int main(){
    int m,n,k;
    scanf("%d%d%d",&m,&n,&k);
    vector<int> seq(n);
    while(k--){
        int len=0;
        stack<int> stk;
        for(int i=0;i<n;i++){
            scanf("%d",&seq[i]);
        }
        for(int i=1;i<=n;i++){
            stk.push(i);
            if(stk.size()>m){
                break;
            }
            while(!stk.empty() && stk.top()==seq[len]){
                len++;
                stk.pop();
            }
        }
        if(len==n){
            printf("YES\n");
        }else{
            printf("NO\n");
        }
    }
    return 0;
}