hdu 1022 Train Problem（栈）

最新推荐文章于 2021-06-04 17:00:41 发布

原创最新推荐文章于 2021-06-04 17:00:41 发布 · 343 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#hdu #栈

STL 专栏收录该内容

17 篇文章

订阅专栏

本文介绍了一个经典的列车调度问题，通过栈的数据结构实现列车进出站的顺序调整。文章提供了一段完整的C++代码示例，详细解释了如何通过栈来判断是否能够按照预期顺序发出列车。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Train Problem

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

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

题意：给出一个入车顺序，给一个出车顺序，问能不能实现该出车顺序

分析：每次入车后判断栈顶是不是应该出车，若是，则一直出车直到不是，然后接着入车继续判断直到入车结束，栈操作完了，若栈内仍有元素则输出No.

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
using namespace std;

int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        char a[15],b[15];
        cin>>a>>b;
        string q[20];
        stack <char> sta;
        int j=0,k=0;
        for(int i=0;i<n;i++)
        {
            sta.push(a[i]);
            q[j++]="in";
            while(!sta.empty()&&sta.top()==b[k])
            {
                sta.pop();
                q[j]="out";
                j++;
                k++;
            }
        }
        if(!sta.empty()) printf("No.\nFINISH\n");
        else
        {
            printf("Yes.\n");
            for(int i=0;i<2*n;i++)
            {
                cout<<q[i]<<endl;
            }
            printf("FINISH\n");
        }
    }
    return 0;
}