02-线性结构3. Pop Sequence (25)
来源:互联网 发布:上古卷轴美女捏脸数据 编辑:程序博客网 时间:2024/06/06 19:30
Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. Youare supposed to tell if a given sequence of numbers is a possible pop sequence of the stack. For example, if M is 5 and Nis 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
继续学习数据结构。
这个题目对我来说有点困难,我竟然不知道有stack这个库,还用vector来模拟,这样会比较烦,比较烦,下次就知道了,还是见识窄啊。
题目的解题思路是简单的,就是比较当前栈的top值,和当前的数值,不相等的话,就一直push进来,直到相等,或者是溢出MaxSize。
code如下:
#include <iostream>#include <stack>/* run this program using the console pauser or add your own getch, system("pause") or input loop */int main(int argc, char** argv) {int MaxSize=0,N=0,K=0;int a[1010];scanf("%d %d %d",&MaxSize,&N,&K);//for(i=0;i<N;i++) v.push_back(i);for(int i=0; i<K; i++){int idx=1;bool flag=true;std::stack<int> s;for(int j=0; j<N; j++){scanf("%d",&a[j]);if(flag){while(s.empty() || s.top() != a[j]){s.push(idx);if(s.size()>MaxSize){flag=false;break;}idx++;}if(flag && s.size()>=1 && s.top()==a[j]) s.pop();}}if(!flag) printf("NO\n");else printf("YES\n");}return 0;}
- 02-线性结构3. Pop Sequence (25)
- 02-线性结构3. Pop Sequence (25)
- 02-线性结构3. Pop Sequence (25)
- 02-线性结构3. Pop Sequence
- 02-线性结构3. Pop Sequence
- 02-线性结构4. Pop Sequence (25)
- 02-线性结构4. Pop Sequence (25)
- 02-线性结构4. Pop Sequence(25)
- 02-线性结构4. Pop Sequence (25)
- PAT 02-线性结构3. Pop Sequence (25)
- PAT 数据结构 02-线性结构4. Pop Sequence (25)
- 02-线性结构3 Pop Sequence (25分)
- 02-线性结构4 Pop Sequence (25分)
- 02-线性结构4 Pop Sequence (25分)
- 02-线性结构4 Pop Sequence (25分)
- 02-线性结构4 Pop Sequence (25分)
- 02-线性结构4 Pop Sequence (25分)
- 02-线性结构4 Pop Sequence (25分)
- 成员初始化表的作用 实例解析
- hostapd源代码分析(三):管理帧的收发和处理
- 【iOS】地图定位无效及点击设置隐私定位直接闪退问题
- Astyle使用方法
- JDBC 实战应用
- 02-线性结构3. Pop Sequence (25)
- VS2013禁止生成ipch和sdf文件
- 套接字基础知识
- Sirius:密歇根大学开发的免费开源版“Siri”
- 建议java程序员读的几本书
- AP模式中多重基础服务集(Multi-BSS)下帧的接收
- txt转换成pdf的制作方法
- HTTP 错误 500.21 - Internal Server Error处理程序“PageHandlerFactory-Integrated”在其模块列表中有一个错误模块“ManagedPipel
- Memcached 及 Redis 架构分析和比较