算法競賽入門經典(第二版)——劉汝佳(學習筆記)

P140——例題6-2鐵軌(Rails)

https://www.nowcoder.com/questionTerminal/1e9cbc2a123a4117a6f78567afc11b5b

牛客網原題。

鏈接:https://www.nowcoder.com/questionTerminal/1e9cbc2a123a4117a6f78567afc11b5b
來源:牛客網

There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It was possible to establish only a surface track. Moreover, it turned out that the station could be only a dead-end one (see picture) and due to lack of available space it could have only one track.
<center> </center>
The local tradition is that every train arriving from the direction A continues in the direction B with coaches reorganized in some way. Assume that the train arriving from the direction A has N

輸入描述

The input consists of blocks of lines. Each block except the last describes one train and possibly more requirements for its reorganization. In the first line of the block there is the integer N described above. In each of the next lines of the block there is a permutation of 1, 2, ..., N. The last line of the block contains just 0.

The last block consists of just one line containing 0.

輸出描述

The output contains the lines corresponding to the lines with permutations in the input. A line of the output contains Yes if it is possible to marshal the coaches in the order required on the corresponding line of the input. Otherwise it contains No. In addition, there is one empty line after the lines corresponding to one block of the input. There is no line in the output corresponding to the last ``null'' block of the input.

輸入例子

5
1 2 3 4 5
5 4 1 2 3
0
6
6 5 4 3 2 1
0
0

輸出例子

Yes
No

Yes

 

 

發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章