1051 Pop Sequence (25 分)

最新推荐文章于 2021-04-17 18:33:37 发布

原创最新推荐文章于 2021-04-17 18:33:37 发布 · 146 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

PAT 同时被 2 个专栏收录

224 篇文章

订阅专栏

PAT (甲级) Practice

121 篇文章

订阅专栏

本文介绍了一个算法问题，即如何判断给定的一组数字序列是否能通过一个最大容量为M的栈的压入和弹出操作得到。文章详细解释了输入输出规范，并提供了一个C++代码示例，用于解决这一问题。

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

#include <bits/stdc++.h>
using namespace std;
const int maxn=1001;
int arr[maxn];
stack<int>st;
int main()
{
    int n,m,t;
    scanf("%d%d%d",&m,&n,&t);
    while(t--)
    {
        while(!st.empty())
        {
            st.pop();
        }
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&arr[i]);
        }
        int current=1;
        bool flas=true;
        for(int i=1; i<=n; i++)
        {
            st.push(i);
            if(st.size()>m)
            {
                flas=false;
                break;
            }
            while(!st.empty()&&st.top()==arr[current])
            {
                st.pop();
                current++;
            }
        }
        if(st.empty()==true&&flas==true)
        {
            printf("YES\n");
        }
        else
        {
            printf("NO\n");
        }
    }
    return 0;
}