关闭

PAT甲级1051. Pop Sequence (25)

143人阅读 评论(0) 收藏 举报
分类:

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 <cstdio>
using namespace std;
#include <stack>
#include <vector>

int main(){
    int M,N,K;
    scanf("%d %d %d",&M,&N,&K);

    vector<int> V(N);
    for(int k=0;k<K;k++){
        stack<int> S;
        S.push(0);
        int flag=1;
        int current=0;
        for(int i=0;i<N;i++){
            scanf("%d",&V[i]);
            if(flag){
                if(S.top()<V[i]){
                    for(int m=current+1;m<=V[i];m++) {
                        S.push(m);
                        if(S.size()>M+1) {
                            flag=0;
                            break;
                        }
                    }
                    S.pop();
                    current=V[i];
                }
                else if(S.top()==V[i]) S.pop();
                else flag=0;
            }
        }
        if(flag) printf("YES\n");
        else printf("NO\n");
    }

    return 0;
}
0
0
查看评论

1051. Pop Sequence (25)-PAT甲级真题(栈模拟)

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 supp...
  • liuchuo
  • liuchuo
  • 2016-08-15 22:08
  • 305

PAT甲级 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 ...
  • changeforeve
  • changeforeve
  • 2017-11-14 18:20
  • 24

1051. Pop Sequence (25)-PAT甲级真题

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 suppo...
  • qq_35033987
  • qq_35033987
  • 2017-12-14 10:43
  • 13

1051. Pop Sequence (25)PAT甲级

传送门#include<stdio.h> #include<stack>#define MAX_N 1100 using namespace std;int arr[MAX_N]; stack<int> st; int main(){ int m,n,k;...
  • SY_Yu
  • SY_Yu
  • 2017-02-03 19:08
  • 95

PAT甲级练习1051. Pop Sequence (25)

1051. Pop Sequence (25) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue ...
  • a1025461748
  • a1025461748
  • 2017-02-25 22:03
  • 168

PAT - 甲级 - 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 s...
  • qq_34594236
  • qq_34594236
  • 2017-11-25 11:02
  • 100

PAT 甲级 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 s...
  • zengjingchao
  • zengjingchao
  • 2017-09-30 12:51
  • 63

【PAT甲级】1051. Pop Sequence (25)

#include <stdio.h> #include <stack> #include <deque> using namespace std;int main(int argc, char *argv[]) { int m, n, k, a; ...
  • lambsnow
  • lambsnow
  • 2016-10-27 22:49
  • 68

PAT 1051. Pop Sequence (25)

1051. Pop Sequence (25) 时间限制 10 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard Given a stack which can keep M numbers at most. P...
  • u010069101
  • u010069101
  • 2014-03-11 14:27
  • 399

【PAT】1051. Pop Sequence (25)

题目链接:http://pat.zju.edu.cn/contests/pat-a-practise/1051 题目描述: Given a stack which can keep M numbers at most. Push N numbers in the order of 1, ...
  • realxuejin
  • realxuejin
  • 2013-08-27 19:40
  • 1294
    个人资料
    • 访问:10320次
    • 积分:878
    • 等级:
    • 排名:千里之外
    • 原创:82篇
    • 转载:0篇
    • 译文:0篇
    • 评论:0条
    文章分类