A1051. Pop Sequence (25)
来源:互联网 发布:javascript 技巧 编辑:程序博客网 时间:2024/06/08 11:29
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<cstdio>#include<stack>using namespace std;const int maxn = 1010;int a[maxn];stack<int> st;int main(){int n, m, k;scanf("%d %d %d", &m, &n, &k);while(k--){for(int i = 1; i <= n; ++i){scanf("%d", &a[i]);}while(!st.empty()){st.pop();}int pop_seq = 1; //入栈元素push_now, 出栈序列索引pop_seqbool flag = true;for(int i = 1; i <= n; ++i){st.push(i);if(st.size() > m){flag == false;break;}while(!st.empty()&& st.top() == a[pop_seq]){st.pop();++pop_seq;}}if(st.empty() && flag ){printf("YES\n");}else{printf("NO\n");}}return 0;}
- A1051. Pop Sequence (25)
- pat-a1051. Pop Sequence (25)
- PAT A1051. Pop Sequence (25)
- PAT A1051 Pop Sequence
- PAT A1051 pop sequence
- pat甲级A1051 Pop Sequence
- 栈的应用--PAT.A1051. Pop Sequence
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- 1051. Pop Sequence (25)
- Android照相以及从相册中选择相片
- C++/C 宏定义(define)中#和## 的含义
- 关于js window.setTimeout()方法
- 短短三年,从职员到院长,北漂青年华丽转身
- 无限自动滑动的ViewPager
- A1051. Pop Sequence (25)
- Windows 7 64位 Android NDK 调试
- msyql触发器简单实例
- php数据类型和表达式学习总结
- Filter 过滤器
- 01背包问题
- android开发之蓝牙初步 扫描已配对蓝牙、更改蓝牙可见性、搜索外部蓝牙设备
- 关于前端的一些介绍
- JSON