poj 1363
来源:互联网 发布:网络黄金能上市吗? 编辑:程序博客网 时间:2024/06/01 08:04
Language:
Rails
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25336 Accepted: 9953
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.
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.
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
Source
Central Europe 1997
#include <iostream>#include <cstdio>#include <stack>#include <vector>using namespace std;#define maxn 1000+10///stack<int> s;int a[maxn];int main(){ int n; while(cin>>n&&n) { while(cin>>a[1]&&a[1]) { stack<int> s; for(int i=2; i<=n; i++) cin>>a[i]; int cn1=1,cn2=1; int flag=1; while(cn2<=n) { if(cn1==a[cn2]) { cn1++; cn2++; } else if(!s.empty()&&s.top()==a[cn2]) { s.pop(); cn2++; } else if(cn1<=n) s.push(cn1++); else { flag=0; break; } } printf("%s\n",flag ? "Yes" : "No"); } cout<<endl; } return 0;}
0 0
- POJ 1363
- poj 1363
- POJ 1363
- poj 1363
- POJ 1363
- poj 1363
- POJ 1363
- poj 1363
- poj 1363
- POJ 1363
- POJ-1363
- POJ-1363
- POJ 1363
- Poj 1363 Rails
- 【poj】1363-Rails
- POJ 1363 Rails
- POJ 1363(栈)
- [poj] 1363 Rails
- 采用手势的上下左右来实现图像的处理
- 找到数组中第一个不见的正整数(First Missing Positive )
- IPC参数(共享内存/信号量)
- word实现表格编号自动更新,同时实现文档中与表格编号对应引用的同步更新方法
- Apache自定义日志格式
- poj 1363
- 求回文数和素数
- 水晶报表(使用VS2010配合水晶报表)
- APK反编译工具使用
- C#读取Excel表格中内容并显示在DataGridView控件中
- 2014/11/11 充满意义的一天
- RakNet学习(34) -- Directory Delta Transfer
- 【JS】【Core】类型转换
- linux编译curl库的动态库so