A
来源:互联网 发布:筋长一寸寿延十年 知乎 编辑:程序博客网 时间:2024/05/16 06:41
栈和队列问题
ACboy was kidnapped!!
he miss his mother very much and is very scare now.You can't image how dark the room he was put into is, so poor :(.
As a smart ACMer, you want to get ACboy out of the monster's labyrinth.But when you arrive at the gate of the maze, the monste say :" I have heard that you are very clever, but if can't solve my problems, you will die with ACboy."
The problems of the monster is shown on the wall:
Each problem's first line is a integer N(the number of commands), and a word "FIFO" or "FILO".(you are very happy because you know "FIFO" stands for "First In First Out", and "FILO" means "First In Last Out").
and the following N lines, each line is "IN M" or "OUT", (M represent a integer).
and the answer of a problem is a passowrd of a door, so if you want to rescue ACboy, answer the problem carefully!
he miss his mother very much and is very scare now.You can't image how dark the room he was put into is, so poor :(.
As a smart ACMer, you want to get ACboy out of the monster's labyrinth.But when you arrive at the gate of the maze, the monste say :" I have heard that you are very clever, but if can't solve my problems, you will die with ACboy."
The problems of the monster is shown on the wall:
Each problem's first line is a integer N(the number of commands), and a word "FIFO" or "FILO".(you are very happy because you know "FIFO" stands for "First In First Out", and "FILO" means "First In Last Out").
and the following N lines, each line is "IN M" or "OUT", (M represent a integer).
and the answer of a problem is a passowrd of a door, so if you want to rescue ACboy, answer the problem carefully!
The first line has one integer,represent the number oftest cases.
And the input of each subproblem are described above.
44 FIFOIN 1IN 2OUTOUT4 FILOIN 1IN 2OUTOUT5 FIFOIN 1IN 2OUTOUTOUT5 FILOIN 1IN 2OUTIN 3OUT
122112None23
#include<iostream> #include<cstdio>#include <stack>#include <queue> #include<cstring> #include<algorithm>using namespace std; int main() {int n,t; char a[1002],str[190]; scanf("%d",&n); while(n--) { int m; scanf("%d %s",&m,a); if(strcmp(a,"FIFO")==0) { queue<int >que; char str1[102];while(m--) { scanf("%s",str1); if(strcmp(str1,"IN")==0) { scanf("%d",&t); que.push(t);} else if(strcmp(str1,"OUT")==0) { if(que.empty()==0) { printf("%d\n",que.front()); que.pop(); } else { printf("None\n"); }}} } if(strcmp(a,"FILO")==0) { stack<int >sta;while(m--) { scanf("%s",str); if(strcmp(str,"IN")==0) { scanf("%d",&t); sta.push(t);} else if(strcmp(str,"OUT")==0) { if(sta.empty()==0) { printf("%d\n",sta.top()); sta.pop(); } else printf("None\n"); } } } } return 0;}
阅读全文
0 0
- a
- a
- a
- a
- a
- a
- a
- a
- a
- a
- a
- a
- a
- A
- A*
- a
- A
- a
- 【BZOJ】1598 [Usaco2008 Mar]牛跑步 k短路(最短路径+A*)
- 会话技术
- MyBatis注解
- NYOJ 833 取石子(七)
- 2017最佳经典之作-AngularJs 中select 下拉多选
- A
- 《剑指offer》笔记-第4章(4)
- idea 配置Tomcat
- 关于卸载赛风(psiphon)打不开网页解决办法
- 【分享】一些经典的C/C++语言基础算法及代码(一)
- 【分享】一些经典的C/C++语言基础算法及代码(二)
- 【分享】一些经典的C/C++语言基础算法及代码(三)
- 【分享】一些经典的C/C++语言基础算法及代码(四)
- 关键字@property与@synthesize梳理