PAT (Advanced Level) 1051. Pop Sequence (25)

简单题。

#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<map>
#include<queue>
#include<string>
#include<stack>
#include<vector>
using namespace std;int n,k,m;
int a[1000+10];
stack<int>S;bool check()
{while(!S.empty()) S.pop();int Max=0,sz=0;int now=1;int p=1;while(1){int tmp=sz;if(S.empty()&&p<=k){S.push(p++);sz++;Max=max(sz,Max);}else{if(S.top()==a[now]){S.pop(); now++;sz--;}else{if(p<=k){S.push(p++);sz++;Max=max(sz,Max);}}}if(now==k+1||sz==tmp) break;}if(Max<=m&&now==k+1) return 1;return 0;
}int main()
{scanf("%d%d%d",&m,&k,&n);for(int i=1;i<=n;i++){for(int j=1;j<=k;j++) scanf("%d",&a[j]);if(check()) printf("YES\n");else printf("NO\n");}return 0;
}

转载于:https://www.cnblogs.com/zufezzt/p/5527624.html

PAT (Advanced Level) 1051. Pop Sequence (25)相关推荐

【PAT甲】1051 Pop Sequence (25分)判断出栈顺序的合法性
problem 1051 Pop Sequence (25分) Given a stack which can keep M numbers at most. Push N numbers in th ...
【PAT (Advanced Level) Practice】1051 Pop Sequence (25 分)
1051 Pop Sequence (25 分) Given a stack which can keep M numbers at most. Push N numbers in the order ...
【详细注释】1051 Pop Sequence (25 分)
立志用最少的代码做最高效的表达 PAT甲级最优题解-->传送门 Given a stack which can keep M numbers at most. Push N numbers in ...
【PAT甲级 stack queue的使用】1051 Pop Sequence (25 分) C++ 全部AC
题目思路维护三个集合:核心栈.数字队列.目标队列详细思路见注释题解 C++ #include<iostream> #include<stack> #include< ...
PAT (Advanced Level) Practice 1166 Summit (25 分)
题目因为只是判断是否是直接相连,所以觉得直接用暴力模拟,而且数据范围也很小.果然,许久不练题,A题的效率都下降了.不过,练题真的是打发时间的好途径. #include <bits/stdc++ ...
PAT (Advanced Level) Practice 题解代码 - II （1051-1100）
PAT PAT (Advanced Level) Practice - II(1051-1100) -------------------------------------------------- ...
PAT (Advanced Level) Practice 1043 Is It a Binary Search Tree (25 分) 凌宸1642
PAT (Advanced Level) Practice 1043 Is It a Binary Search Tree (25 分) 凌宸1642 题目描述: A Binary Search Tr ...
PAT甲级1051 Pop Sequence：[C++题解]模拟栈、判断序列是否是合法的出栈序列
文章目录题目分析题目来源题目分析来源:acwing 分析: 题意:将1~N压栈,判断给定序列是否是合法的出栈序列. 对于序列1~N中的每个值i,先将其压入栈.然后对于它就有两种处理方法:要么压 ...
PAT (Advanced Level) Practice 1011 World Cup Betting (20 分) 凌宸1642
PAT (Advanced Level) Practice 1011 World Cup Betting (20 分) 凌宸1642 题目描述: With the 2010 FIFA World Cu ...

PAT (Advanced Level) 1051. Pop Sequence (25)

PAT (Advanced Level) 1051. Pop Sequence (25)相关推荐

最新文章

热门文章