poj1363: Rails解题报告
来源:互联网 发布:淘宝在哪开店 编辑:程序博客网 时间:2024/04/30 10:00
Rails
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 35063 Accepted: 13613
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<stack>bool check(int * a,int n);using namespace std;int main(){int n; while(cin>>n&&n){int *a=new int[n];while(cin>>a[0]&&a[0]){for(int i=1;i<n;i++){cin>>a[i];}if(check(a,n)){cout<<"Yes"<<endl;}elsecout<<"No"<<endl;}cout<<endl;}return 0;}bool check(int * a,int n){stack<int > s; int po=0;for(int i=0;i<n;i++){for(int j=po+1;j<=a[i];j++){po=j; //po是目前为止入栈的最大值 s.push(j);}if(s.top()!=a[i]){return 0;}s.pop();}return 1;}
阅读全文
0 0
- poj1363: Rails解题报告
- poj1363--Rails解题报告(c++版)
- POJ1363(解题报告)
- POJ1363:Rails
- 1363 Rails 解题报告
- poj1363——Rails
- POJ1363--Rails--栈
- POJ1363 Rails【stack】【栈】
- poj1363——Rails
- POJ1363 Rails(栈)
- POJ1363 Rails(数据结构栈)
- poj1363 Rails(栈模拟)
- POJ1363:Rails(栈)
- 【栈】POJ1363-Rails
- POJ1363 Rails【单调栈】
- POJ1363 Rails 栈+模拟
- USACO Fence Rails 解题报告
- 【Jason's_ACM_解题报告】Rails
- Activiti扩展组织结构
- Word Ladder
- Android Studio Ndk 编程
- origin 函数
- 基于OpenStack和Kubernetes构建组合云平台——网络集成方案综述
- poj1363: Rails解题报告
- (9) 数据结构入门概念小结--每天五分钟学习数据结构
- oracle数据库学习之初步(1)
- 万维链
- [转载]最近让ibm的processor folding给害了
- 1053. 住房空置率
- 机器学习--线性回归
- JDK环境变量配置
- 编程实现一个单链表的查找