[sicily]1509. Rails
来源:互联网 发布:学会python要多久 编辑:程序博客网 时间:2024/05/01 13:37
1509. Rails
Constraints
Time Limit: 1 secs, Memory Limit: 32 MB
Description
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 N <= 1000 coaches numbered in increasing order 1, 2, ..., N. 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 a1, a2, ..., aN. 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 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.
Output
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.
Sample Input
51 2 3 4 55 4 1 2 3066 5 4 3 2 100
Sample Output
YesNoYes
Problem Source
Central Europe 1997
简单的栈操作,判断能否得到希望的出栈顺序。直接利用STL里的栈进行即可,代码如下:
#include <iostream>#include <stack>using namespace std;int main(){ int i,j,n; int a[1005]; while ( cin>>n && n) { while ( cin>> a[1] && a[1]) { stack <int> s; for( i = 2; i<= n;i++) cin>>a[i];//希望的出栈顺序 int m = 1; for( i = 1;i<=n;i++) { s.push( i );//入栈,然后下面while 循环处理出栈情况 while ( !s.empty() && a[m] == s.top () ) { s.pop(); m++; } } if( s.empty() ) cout<<"Yes"<<endl; else cout<<"No"<<endl; } cout<<endl; }// system("pause");}
- Sicily 1509. Rails
- sicily--1509. Rails
- sicily 1509. Rails
- sicily 1509. Rails
- Sicily 1509. Rails
- [sicily]1509. Rails
- sicily Rails
- <Sicily>Rails
- Sicily 1509.Rails——栈入栈出
- sicily 1509 Rails
- 1509. Rails
- 1509.Rails
- Rails
- Rails
- Rails
- rails
- Rails
- rails
- 使用帧缓冲区进行三维交互
- 王爽第九章依据位移进行转移的jmp指令
- hdu1248寒冰王座【完全背包入门题】
- HANA学院(7)- (5)从SAP HANA Studio连接到SAP HANA
- jfinal集成spring cxf做webservice服务
- [sicily]1509. Rails
- 软件工程师进阶系列——万变不离其宗(设计模式下午题大盘点)
- linux 套接口缓存
- 正确理解hadoop 2.x 的环形缓冲区: (一) MR环形缓冲区的结构
- 《数据结构(严蔚敏版)》学习笔记(五)——串的模式匹配算法
- android 中 sqlite sql语句 参数 分析
- lightoj 1427 Substring Frequency (||) (AC自动机)
- LeetCode Contains Duplicate III
- Hadoop之HDFS架构(NameNode和DataNode)