HDU1702 ACboy needs your help again! 队列&&栈的应用

ACboy needs your help again! Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5222    Accepted Submission(s): 2709 Problem Description 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!   Input The input contains multiple test cases. The first line has one integer,represent the number oftest cases. And the input of each subproblem are described above.   Output For each command "OUT", you should output a integer depend on the word is "FIFO" or "FILO", or a word "None" if you don't have any integer.   Sample Input 4 4 FIFO IN 1 IN 2 OUT OUT 4 FILO IN 1 IN 2 OUT OUT 5 FIFO IN 1 IN 2 OUT OUT OUT 5 FILO IN 1 IN 2 OUT IN 3 OUT   Sample Output 1 2 2 1 1 2 None 2 3   Source 2007省赛集训队练习赛（1）

C++ STL--stack/queue 的使用方法 1、stack stack 模板类的定义在<stack>头文件中。 stack 模板类需要两个模板参数，一个是元素类型，一个容器类型，但只有元素类型是必要 的，在不指定容器类型时，默认的容器类型为deque。 定义stack 对象的示例代码如下： stack<int> s1; stack<string> s2; stack 的基本操作有： 入栈，如例：s.push(x); 出栈，如例：s.pop();注意，出栈操作只是删除栈顶元素，并不返回该元素。 访问栈顶，如例：s.top() 判断栈空，如例：s.empty()，当栈空时，返回true。 访问栈中的元素个数，如例：s.size()。  2、queue queue 模板类的定义在<queue>头文件中。 与stack 模板类很相似，queue 模板类也需要两个模板参数，一个是元素类型，一个容器类 型，元素类型是必要的，容器类型是可选的，默认为deque 类型。 定义queue 对象的示例代码如下： queue<int> q1; queue<double> q2; queue 的基本操作有： 入队，如例：q.push(x); 将x 接到队列的末端。 出队，如例：q.pop(); 弹出队列的第一个元素，注意，并不会返回被弹出元素的值。 访问队首元素，如例：q.front()，即最早被压入队列的元素。 访问队尾元素，如例：q.back()，即最后被压入队列的元素。 判断队列空，如例：q.empty()，当队列空时，返回true。 访问队列中的元素个数，如例：q.size() #include <stdio.h> #include <iostream> #include <string.h> #include <math.h> #include <cstdlib> #include <queue> #include <stack> #include <algorithm> using namespace std; int inf=99999999; int main() { int n; int a,d; char b[5]; char c[4]; scanf("%d",&n); while(n--){ scanf("%d %s",&a,b); if(b[2]=='L'){ stack<int> S; while(a--){ scanf("%s",c); if(c[0]=='I'){ scanf("%d",&d); S.push(d); } else{ if(S.empty()){printf("None\n");} else{ printf("%d\n",S.top()); S.pop(); } } } } if(b[2]=='F'){ queue<int> Q; //队列 while(a--){ scanf("%s",c); if(c[0]=='I'){ scanf("%d",&d); Q.push(d); } else{ if(Q.empty()){printf("None\n");} else{ printf("%d\n",Q.front()); Q.pop(); } } } } } return 0; }