uva 514 - Rails
2015-02-08 23:30
309 查看
Rails |
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.
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
coaches
numbered in increasing order
. The chief for train reorganizations must know whether it is possible to marshal coaches continuing
in the direction B so that their order will be
. Help him and write a program that decides whether it is possible to
get the required order of coaches. You can assume that single coaches can be disconnected from the train before they enter the station and that they can move themselves until they are on the track in the direction B. You can also suppose that at any time there
can be located as many coaches as necessary in the station. But once a coach has entered the station it cannot return to the track in the direction A and also once it has left the station in the direction B it cannot return back to the station.
Input
The input file 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 describedabove. In each of the next lines of the block there is a permutation of
The
last line of the block contains just 0.
The last block consists of just one line containing 0.
Output
The output file contains the lines corresponding to the lines with permutations in the input file. A line of the output file contains Yes if itis possible to marshal the coaches in the order required on the corresponding line of the input file. Otherwise it contains No. In addition, there is one empty line after the lines corresponding
to one block of the input file. There is no line in the output file corresponding to the last ``null'' block of the input file.
Sample Input
5 1 2 3 4 5 5 4 1 2 3 0 6 6 5 4 3 2 1 0 0
Sample Output
Yes No Yes
#include<iostream> #include<cstdio> #include<cstring> #include<stack> using namespace std; const int MAX=1010; int b[MAX],n,i; int main() { while(scanf("%d",&n),n) { while(scanf("%d",b+1),b[1]) { stack<int>a; for(i=2; i<=n; i++) scanf("%d",&b[i]); int A=1,B=1,o=1; while(A<=n) /// B从1开始 是进去的火车序号, A是最后火车序列的下标 { if(b[A]==B) { B++; A++; } else if((!a.empty())&&b[A]==a.top()) { a.pop(); A++; } else if(B<=n) a.push(B++); else { o=0; break; } } printf("%s\n",o?"Yes":"No"); } puts("");/// 注意换行 } return 0; }
相关文章推荐
- UVA - 514 - Rails
- UVA 514 Rails(模拟|栈)
- UVa_514 - Rails
- Rails(UVa514)(栈)
- 【栈】UVA - 514 Rails
- UVa 514 Rails(stack)
- Uva Oj 514 - Rails
- UVA_514: Rails
- 例题6-2 UVA 514 - Rails (铁轨)
- UVa--514 Rails (stack)
- UVa 514 - Rails
- 经典第六章 例题 6-2 UVA 514 Rails(栈的基础应用)
- stack&&UVa514 Rails (铁轨)的理解与解析
- Rails uva514
- UVA 514 Rails
- uva 514 Rails
- Rails,ACM/ICPC CERC 1997,UVa 514
- Rails UVA 514(栈模拟,水题)
- UVa514 Rails
- UVa 514 Rails (water ver.)