zoukankan      html  css  js  c++  java
  • HDU 1022 (栈的基本应用)

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

    Train Problem I

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 22954    Accepted Submission(s): 8652

    Problem Description
    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.
     
    Input
    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.
     
    Output
    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.
     
    Sample Input
    3 123 321
    3 123 312
     
    Sample Output
    Yes.
    in
    in
    in
    out
    out
    out
    FINISH
    No.
    FINISH
     
    题目大意:判断能否将字符串s1通过栈变成s2.
     
     1 #include <cstdio>
     2 #include <cstring>
     3 #include <stack>
     4 #include <iostream>
     5 #include <algorithm>
     6 using namespace std;
     7 
     8 int main ()
     9 {
    10     int n,i,j,k;
    11     char in[20],out[20];
    12     int flag[50];
    13     stack <char> s;
    14     while (scanf ("%d%s%s",&n,in,out)==3)
    15     {
    16         while (!s.empty())//清空栈,
    17         s.pop();
    18         memset(flag, 0, sizeof(flag));
    19         j = k = 0;
    20         for (i=0; i<n; i++)
    21         {
    22             s.push(in[i]);//入栈
    23             flag[k++] = 1;//标记
    24             while (!s.empty() && s.top() == out[j])//如果栈顶元素是要出栈的元素,出栈
    25             {
    26                 flag[k++] = 0;
    27                 s.pop();
    28                 j++;
    29             }
    30         }
    31         if (j == n)
    32         {
    33             printf ("Yes.
    ");
    34             for (i=0; i<k; i++)
    35             {
    36                 if (flag[i])
    37                 printf ("in
    ");
    38                 else
    39                 printf ("out
    ");
    40             }
    41         }
    42         else
    43         printf ("No.
    ");
    44         printf ("FINISH
    ");
    45     }
    46     return 0;
    47 }
    View Code
  • 相关阅读:
    【STM32H7】第3章 ThreadX GUIX和GUIX Studio介绍
    【STM32F429】第3章 ThreadX GUIX和GUIX Studio介绍
    Spring Boot Devtools 依赖详解
    《深入理解 Java 虚拟机》-- 读书笔记
    JAVA连接MySQ报错:Caused by: javax.net.ssl.SSLException: Received fatal alert: protocol_version
    JAVA生成文件的md5校验值
    IDEA启动报错:Error:java: Compilation failed: internal java compiler error
    JAVA读取本地html文件里的html文本
    SpringBoot打包实现静态文件、配置文件、jar包分离
    SpringBoot中Post请求提交富文本数据量过大参数无法获取的问题
  • 原文地址:https://www.cnblogs.com/dxd-success/p/4245857.html
Copyright © 2011-2022 走看看