zoukankan      html  css  js  c++  java
  • HDU 1022 Train Problem I(栈)

    描述As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fastest all over the world ^v^). But here comes a problem, there is only one railway where all the trains stop. So all the trains come in from one side and get out from the other side. For this problem, if train A gets into the railway first, and then train B gets into the railway before train A leaves, train A can't leave until train B leaves. The pictures below figure out the problem. Now the problem for you is, there are at most 9 trains in the station, all the trains has an ID(numbered from 1 to n), the trains get into the railway in an order O1, your task is to determine whether the trains can get out in an order O2.

     
    输入
    The input contains several test cases. Each test case consists of an integer, the number of trains, and two strings, the order of the trains come in:O1, and the order of the trains leave:O2. The input is terminated by the end of file. More details in the Sample Input.
    输出
    The output contains a string "No." if you can't exchange O2 to O1, or you should output a line contains "Yes.", and then output your way in exchanging the order(you should output "in" for a train getting into the railway, and "out" for a train getting out of the railway). Print a line contains "FINISH" after each test case. More details in the Sample Output.
    样例输入
    3 123 321
    3 123 312
    
    样例输出
    Yes.
    in
    in
    in
    out
    out
    out
    FINISH
    No.
    FINISH


    一道简单的栈应用。
     1 #include<cstdio>
     2 #include<stack>
     3 #include<vector>
     4 #include<cstring>
     5 #include<string>
     6 #include<iostream>
     7 #include<algorithm>
     8 using namespace std;
     9 #define maxsize 301
    10 char in[maxsize];
    11 char out[maxsize];
    12 int main()
    13 {
    14     stack<int>s;
    15     vector<string>stl;
    16     int n,i,j;
    17     while(cin>>n>>in>>out)
    18     {
    19         i=0;j=0;
    20         while(i<n)
    21         {
    22             s.push(in[i]);
    23             i++;
    24             stl.push_back("in");
    25             while(!s.empty())
    26             {
    27                 if(s.top()==out[j]&&j<n)
    28                 {
    29                     stl.push_back("out");
    30                     j++;
    31                     s.pop();
    32                 }
    33                 else break;
    34             }
    35         }
    36         if(s.empty())
    37         {
    38             printf("Yes.
    ");
    39             for(i=0;i<stl.size();i++)cout<<stl[i]<<endl;
    40             printf("FINISH
    ");
    41         }
    42         else 
    43         {
    44             printf("No.
    FINISH
    ");
    45         }
    46         stl.clear();
    47         for(i=s.size();i>0;i--)s.pop();
    48     }
    49     return 0;
    50 }
  • 相关阅读:
    一线架构师实践指南第三编阅读笔记
    学习七
    《信息领域热词分析》,如何设计编码实现六种质量属性战术
    学习六
    一线架构师实践指南第二部分阅读笔记
    学习五
    echarts实现省市区地图下钻
    python提取文本关键词
    后缀自动机复习笔记
    bzoj 1552
  • 原文地址:https://www.cnblogs.com/Annetree/p/5639080.html
Copyright © 2011-2022 走看看