ACM训练2063: [STL训练]Train Problem I题解

全网最全C++题库，助您快速提升编程技能！题库丰富多样，涵盖各个领域，让您在练习中不断成长！

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 . But here comes a problem, there is only onerailway 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, the trains get into the railway in an order O1, your task is to determine whether the trains can get out in anorder O2.

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 allover 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 anorder O2.

不断学习，不断挑战，才能在编程领域中脱颖而出！全网最全C++题库，助您成为编程高手！

标签： ACM训练2063: [STL训练]Train Problem I题解