Pop Sequence
来源:互联网 发布:有什么发型软件 编辑:程序博客网 时间:2024/05/30 02:26
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 51 2 3 4 5 6 73 2 1 7 5 6 47 6 5 4 3 2 15 6 4 3 7 2 11 7 6 5 4 3 2Sample Output:
YESNONOYESNO
提交代码
#include<stdio.h>#include<stack>using namespace std;const int maxn=1010;int arr[maxn];stack <int> st;int main(){int m,n,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 flag=true;for(int i=1;i<=n;i++){st.push(i); if(st.size()>m){flag=false;break;}while(!st.empty() && st.top()==arr[current]){st.pop();current++;}}if(st.empty()==true && flag==true){printf("YES\n");}else{printf("NO\n");}}return 0;}
- Pop Sequence
- Pop Sequence
- Pop Sequence
- Pop Sequence
- Pop Sequence
- Pop Sequence
- Pop Sequence
- Pop Sequence
- Pop Sequence
- Pop Sequence
- 1051. Pop Sequence (25)
- 1051.Pop Sequence
- 1051. Pop Sequence
- pat 1051 pop sequence
- PAT_1051: Pop Sequence
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence
- (一)Docker原理与现状
- java线程的中断(interrupt)
- 根据xml文件生成javaBean
- <C语言>结构体与联合体(共用体)的地址排布问题(内存字节对齐)
- 解决MyEclipseSpring插件安装出错的一种办法
- Pop Sequence
- avaweb学习总结(九)—— 通过Servlet生成验证码图片
- 没有任何机械基础,如何自学机械设计?
- spark 入门、深入学习书籍pdf-2017最强大礼包(精选当当Top10)
- 动态规划46题
- spring-session实现分布式集群session的共享
- Tomcat/Jsp,解决'怎么访问本地图片/资源?'
- xml2json 转换
- Spring-Data-Jpa