PTA甲级 1051 Pop Sequence (C++)

最新推荐文章于 2021-10-17 01:00:43 发布

负反馈循环

最新推荐文章于 2021-10-17 01:00:43 发布

阅读量72

点赞数

分类专栏： PTA 文章标签：栈模拟序列判断 C++ 算法

本文链接：https://blog.csdn.net/qq_43659183/article/details/119727506

版权

PTA 专栏收录该内容

148 篇文章 2 订阅

订阅专栏

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

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-15 23:34:06
// All rights reserved.

#include <iostream>
#include <vector>
#include <stack>

using namespace std;

int main(){
    int m, n, k;
    // m : the maximum capacity of the stack
    // n : the length of push sequence
    // k : the number of pop sequences to be checked

    scanf("%d %d %d", &m, &n, &k);

    vector<vector<int>> toCheck(k, vector<int>(n));

    for(int i = 0; i < k; ++i){
        for(int j = 0; j < n; ++j) scanf("%d", &toCheck[i][j]);
    }

    
    for(int i = 0; i < k; ++i){
        int lastOut = 0;
        stack<int> s;
        int j;

        for(j = 0; j < n; ++j){

            if(toCheck[i][j] > lastOut){

                for(int p = lastOut + 1; p <= toCheck[i][j]; ++p) s.push(p);
            
                if(s.size() > m){
                    printf("NO\n");
                    break;
                }

                s.pop();
                lastOut = toCheck[i][j];
            }
            else if(toCheck[i][j] < lastOut){
                if(toCheck[i][j] != s.top()){
                    printf("NO\n");
                    break;
                }
                else s.pop();
            }
        }

        if(j == n) printf("YES\n");
    }

    return 0;
}