杭电OJ1022～火车进站出站&南阳OJ～括号配对

最新推荐文章于 2020-07-29 15:09:48 发布

林次次

最新推荐文章于 2020-07-29 15:09:48 发布

阅读量1.4k

点赞数

分类专栏：栈文章标签： c语言杭电栈火车进站

本文链接：https://blog.csdn.net/lin14543/article/details/47085291

版权

本文介绍了如何利用栈数据结构解决杭电OJ1022火车进站问题及南阳OJ的括号配对问题。通过栈的特性实现括号的有效匹配，对于输入的括号序列，判断其是否配对。样例测试显示，未正确配对的括号序列将输出"No"，反之则输出"Yes"。

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

Train Problem I

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

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.