zoukankan      html  css  js  c++  java
  • 栈 HDU

    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.
    InputThe 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.
    OutputThe 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.
    Sample Input

    3 123 321
    3 123 312

    Sample Output

    Yes.
    in
    in
    in
    out
    out
    out
    FINISH
    No.
    FINISH
    
    
            
     
    For the first Sample Input, we let train 1 get in, then train 2 and train 3.
    So now train 3 is at the top of the railway, so train 3 can leave first, then train 2 and train 1.
    In the second Sample input, we should let train 3 leave first, so we have to let train 1 get in, then train 2 and train 3.
    Now we can let train 3 leave.
    But after that we can't let train 1 leave before train 2, because train 2 is at the top of the railway at the moment.
    So we output "No.".
    数据的范围比较小~~~
    注意在进站的过程中可以出站,既这辆车进来后可以马上又出去!!!
     1 #include<iostream>
     2 #include<string>
     3 #include<stack>
     4 using namespace std;
     5 int flag;
     6 int main()
     7 {   int n;
     8     while(~scanf("%d",&n))
     9     {   stack <int> In;
    10         int vis[20],order[2*n];
    11         int i,j,k;
    12         char in[n],out[n];
    13        
    14         for(i=0;i<2*n;i++)  vis[i]=0;  
    15         scanf("%s",in);
    16         scanf("%s",out);
    17         
    18         flag=0;
    19         k=j=0;
    20         for(i=0;i<n;i++)
    21         {   if(in[i]!=out[j])
    22             {   In.push(in[i]-'0');
    23                 vis[in[i]-'0']=1;
    24                 order[k++]=1;  
    25                                      //1出站 
    26             }
    27             else
    28             {   order[k++]=1;
    29                 order[k++]=0;
    30                 j++;
    31                 if(j<n){
    32                     while(vis[out[j]-'0']!=0&&!In.empty())
    33                     {   if(In.top()!=(out[j]-'0'))
    34                         {   flag=1;
    35                             break;
    36                         } 
    37                         else 
    38                         {   In.pop();
    39                             j+=1;
    40                             order[k++]=0;
    41                         }
    42                     
    43                     }
    44                 }
    45             }
    46             if(flag) break;
    47         }
    48         //printf("%d
    ",k);
    49         if(flag) cout<<"No."<<endl<<"FINISH"<<endl;
    50         else
    51         {   cout<<"Yes."<<endl;
    52             for(int i=0;i<2*n;i++)
    53             {   if(order[i]) printf("in
    ");
    54                 else printf("out
    ");
    55             }
    56             cout<<"FINISH"<<endl;
    57         }
    58     }
    59 }
  • 相关阅读:
    5.11-上位机重新编程
    3.30-计算机系统互联方案
    3.25-两个操作者的通信模式
    3.23-重新定义操作者框架
    go 修改数组中对象的值不生效的解决方法
    go orm QueryTable Filter 不生效解决方法
    Beego orm.Install() 插入 [单条记录] 或 [一批记录],及出现异常 Handler crashed with error <Ormer> table: `.` not found, make sure it was registered with `RegisterModel()`
    go json 序列号、反序列号和数据类型转换
    go json 转换忽略字段、控制字段可有可无
    Flutter 使用 flutter_inappbrowser 加载 H5 及与 js 交互,Methods marked with @UiThread must be executed on the main thread . Current thread: JavaBridge
  • 原文地址:https://www.cnblogs.com/zgglj-com/p/6533231.html
Copyright © 2011-2022 走看看