As the new term comes, the Ignatius Train Station is very busy nowadays.（栈）

最新推荐文章于 2021-03-15 16:59:47 发布

FREEZE橙

最新推荐文章于 2021-03-15 16:59:47 发布

阅读量1.9k

点赞数 1

本文链接：https://blog.csdn.net/qq_43873952/article/details/90179858

版权

新学期开始，Ignatius火车站变得非常繁忙。由于该站的火车是全球最快的，许多学生选择乘坐火车返校。然而，只有一个铁路，所有火车都必须在此进出，导致存在调度问题。如果火车A先进入，然后火车B在A离开前进入，A就必须等待B离开才能出发。题目要求确定最多9辆火车能否按指定的离开顺序进行调度。输入包含火车数量和进站、出站顺序，输出是否能实现目标顺序及调度过程。

摘要由CSDN通过智能技术生成

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.

![在这里插入图片描述](https://img-blog.csdnimg.cn/2019051