zoukankan      html  css  js  c++  java
  • HDU

    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

    题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=1702

    *******************************************

    题意:题意比较清晰,FIFO则先进先出,FILO则先进后出

    分析:简单的队列和栈的应用就好

    AC代码

     1 #include<stdio.h>
     2 #include<string.h>
     3 #include<math.h>
     4 #include<queue>
     5 #include<algorithm>
     6 #include<time.h>
     7 #include<stack>
     8 using namespace std;
     9 #define N 1000
    10 #define INF 0x3f3f3f3f
    11 
    12 int main()
    13 {
    14     int T,i,a,n;
    15     char s[N],str[N];
    16 
    17     scanf("%d", &T);
    18 
    19     while(T--)
    20     {
    21         scanf("%d %s", &n , s);
    22 
    23         if(s[2]=='F')///存入队列
    24         {
    25             queue<int >Q;
    26             for(i=0;i<n;i++)
    27             {
    28                 scanf("%s", str);
    29                 if(str[0]=='I')
    30                 {
    31                     scanf("%d", &a);
    32                     Q.push(a);
    33                 }
    34                 else
    35                 {
    36                     if(Q.empty())
    37                         printf("None
    ");
    38                     else
    39                     {
    40                         int x=Q.front();
    41                         Q.pop();
    42                         printf("%d
    ", x);
    43                     }
    44                 }
    45             }
    46         }
    47         else
    48         {
    49             stack<int >P;
    50             for(i=0;i<n;i++)
    51             {
    52                 scanf("%s", str);
    53 
    54                 if(str[0]=='I')
    55                 {
    56                     scanf("%d",&a);
    57                     P.push(a);
    58                 }
    59                 else
    60                 {
    61                     if(P.empty())
    62                         printf("None
    ");
    63                     else
    64                     {
    65                         int x=P.top();
    66                         P.pop();
    67                         printf("%d
    ", x);
    68                     }
    69                 }
    70             }
    71         }
    72     }
    73 
    74     return 0;
    75 }
  • 相关阅读:
    基于遗传算法(Genetic Algorithm)的TSP问题求解(C)
    分治思想:合并排序和快速排序
    冒泡排序和选择排序
    WPF线程
    DataGrid属性和事件
    WPF限制TextBox只能输入数字
    键盘键值对应表
    转换人民币大小金额
    查找DataGrid某个单元格中的控件
    WPF中DataGrid使用初步
  • 原文地址:https://www.cnblogs.com/weiyuan/p/5787134.html
Copyright © 2011-2022 走看看