1051 Pop Sequence (25 分)

最新推荐文章于 2024-10-01 04:50:10 发布

Tropine

最新推荐文章于 2024-10-01 04:50:10 发布

阅读量176

点赞数

分类专栏： PAT 甲级文章标签：算法 c++ PAT

本文链接：https://blog.csdn.net/Tropine/article/details/120704204

版权

PAT 甲级专栏收录该内容

34 篇文章 0 订阅

订阅专栏

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

Analysis

这是一道模拟栈的题目。我的算法很简单，先依次push。每次比较有没有超过栈的容量。然后再循环比较栈顶元素和输入给的数组是否一致即可。

Code(C++)

#include <iostream>
#include <stack>
using namespace std;

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