UVA - 514 Rails
来源:互联网 发布:标签设计软件 编辑:程序博客网 时间:2024/06/10 02:33
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.
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 integerN described above. 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 containsYes if it is possible to marshal the coaches in the order required on the corresponding line of the input file. Otherwise it containsNo. 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
51 2 3 4 55 4 1 2 3066 5 4 3 2 100
Sample Output
YesNoYes栈的应用。。。要记得换行。。。#include <iostream> #include <stdio.h> #include <stdlib.h> #include <stack> using namespace std; int d[ 1005 ]; int main() { int n; while ( cin >> n && n ) { while ( cin >> d[1] && d[1] ) { for ( int i = 2 ; i <= n ; ++ i ) cin >> d[i]; stack<int> S; int o = 1,k = 1; while ( o <= n ) { if ( !S.empty() && d[o] == S.top() ) { S.pop(); ++ o; }else if ( d[o] != k ) { S.push(k); if ( ++ k > n ) break; }else { ++ o; ++ k; } } if ( o > n ) cout << "Yes" << endl; else cout << "No" << endl; } cout << endl; } return 0; }
- Uva 514 Rails
- UVa 514 - Rails
- UVA 514 - Rails
- Uva Oj 514 - Rails
- uva 514 Rails
- UVA 514 Rails
- UVA 514 Rails
- Uva 514 Rails
- UVA 514 - Rails(模拟)
- UVA - 514 Rails
- UVa 514 Rails
- uva 514 - Rails(栈)
- UVa 514 Rails(栈)
- UVA 514 Rails
- UVa 514 - Rails
- UVA - 514 Rails
- UVa 514 - Rails
- Uva 514 Rails
- 嵌入式的选择------
- myeclipse各菜单项说明
- android——画廊(Gallery)
- 二叉树
- Android异步消息处理机制完全解析,带你从源码的角度彻底理解
- UVA - 514 Rails
- 敬业集团李赶坡董事长缅怀兄弟亲-最深切的怀念
- UVA 1393 - Highways
- iOS播放多种格式视频
- P2P流媒体开源项目介绍
- IOS开发——手势 & 传感器 & 物理引擎
- 进程识别号(PID)的理解
- 《C++ Primer 第五版》练习9.51参考答案
- 8、一个单链表,不给头指针,只给出当前结点,删除该结点。