HDUOJ 1022 Train Problem I (栈的应用)

最新推荐文章于 2022-04-18 22:01:36 发布

Jayphone17

最新推荐文章于 2022-04-18 22:01:36 发布

阅读量442

点赞数

CC 4.0 BY-SA版权

分类专栏：栈

本文链接：https://blog.youkuaiyun.com/Jayphone17/article/details/79115802

Train Problem I

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 41257 Accepted Submission(s): 15437

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 trai