Rails铁轨(栈)
来源:互联网 发布:ubuntu 16.04 代理 编辑:程序博客网 时间:2024/04/25 13:19
Description
Download as PDF
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.
\begin{picture}(6774,3429)(0,-10)
\put(1789.500,1357.500){\arc{3645.278}{4.7247}...
...tFigFont{14}{16.8}{\rmdefault}{\mddefault}{\updefault}Station}}}}}
\end{picture}
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 \leŸ 1000$ coaches numbered in increasing order $1, 2, \dots, 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 $a_1. a_2, \dots, a_N$. 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 described above. In each of the next lines of the block there is a permutation of $1, 2, \dots, N$ 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 it is 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
Download as PDF
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.
\begin{picture}(6774,3429)(0,-10)
\put(1789.500,1357.500){\arc{3645.278}{4.7247}...
...tFigFont{14}{16.8}{\rmdefault}{\mddefault}{\updefault}Station}}}}}
\end{picture}
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 \leŸ 1000$ coaches numbered in increasing order $1, 2, \dots, 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 $a_1. a_2, \dots, a_N$. 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 described above. In each of the next lines of the block there is a permutation of $1, 2, \dots, N$ 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 it is 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<cstdio>#include<stack>using namespace std;const int N = 1005;int n, tar[N], A, B;int main(){ while (scanf ("%d", &n), n) { while (scanf ("%d", &tar[1]), tar[1]) { for (int i = 2; i <= n; ++i) scanf ("%d", &tar[i]); stack<int> sta; A = B = 1; bool ok = true; while (B <= n) { if (A == tar[B]) { ++A; ++B; } else if (!sta.empty() && sta.top() == tar[B]) { sta.pop(); ++B; } else if (A <= n) sta.push (A++); else { ok = false; break; } } printf (ok ? "Yes\n" : "No\n"); } printf("\n"); } return 0;}
0 0
- Rails铁轨(栈)
- UVa 514 Rails(铁轨) 栈
- UVa514 Rails(铁轨)
- 铁轨(Rails) UVa514
- UVA 514 铁轨 (Rails)
- P36-Rails(铁轨)(POJ-1363数据结构之栈)
- 铁轨(Rails)
- UVa514-Rails-铁轨--栈的使用
- 铁轨Rails UVA514(stack运用)
- 铁轨(栈)
- 铁轨-栈(stack)
- UVA514 Rails(铁轨)
- UVA514:Rails(铁轨)
- Uva514 Rails(铁轨)
- UVA 514 Rails 铁轨
- 例题6-2 UVA 514 - Rails (铁轨)
- 栈(样列:铁轨)
- uva 514 铁轨(栈)
- PHP之类型约束
- 关系型数据库表结构的两个设计技巧
- 一个自动根据xcode中的objective-c代码生成类关系图的神器
- 算法竞赛入门经典(第二版)-刘汝佳-第六章 数据结构基础 例题(17/22)
- HTML,CSS和Javascript综合练习-1
- Rails铁轨(栈)
- 驱动分离分层
- 学习笔记—Activity的启动模式
- QT离线安装包下载地址
- Java中播放声音实例
- Learn Some Framework-3 From Zygote to HOME
- HTTP协议
- Android开发之旅:组件生命周期(一)出处:http://www.cnblogs.com/skynet/
- 存储器的保护(二)——《x86汇编语言:从实模式到保护模式》读书笔记19