Rails
来源:互联网 发布:网络模块接法图解 编辑:程序博客网 时间:2024/05/10 13:54
Rails
题目描述:
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
题目解析:
模拟栈的实现,把右边的数字与左边的数字比较如果相同则直接过去,如果不同则入栈,等待是否有出栈的机会(相同则出栈)。
代码如下:
/************************************************************************* > File Name: Rails.cpp > Author: Frade > Mail: frade@vip.sina.com.cn > Created Time: 2017年05月10日 星期三 09时16分28秒 ************************************************************************/#include <iostream>#include <cstdio>using namespace std;int Getint(){ char c = getchar(); bool flag = false; int ans = 0; while(c != '-' && (c <'0' || c > '9'))c = getchar(); if(c == '-')flag = true,c = getchar(); while(c >= '0' && c <= '9')ans = ans*10 + c - '0',c = getchar(); return (flag == true) ? -ans : ans;}const int maxn = 1005;int n;int a[maxn];int S[maxn];int main(){ while(~scanf("%d",&n) && n) { while(~scanf("%d",&a[1]) && a[1]) { for(int i = 2;i <= n; i++)a[i] = Getint(); int i,j,top = 0; for(i = 1,j = 1;j <= n && i <= n+1;) { if(a[j] == i)i++,j++; else if(S[top] == a[j])top--,j++; else S[++top] = i++; } if(j >= n)printf("Yes\n"); else printf("No\n"); } printf("\n"); } return 0;}
- Rails
- Rails
- Rails
- rails
- Rails
- rails
- Rails
- Rails
- Rails
- Rails
- Rails
- Rails
- Rails
- Rails
- Rails
- rails
- Rails
- Rails
- 快速排序
- IOS系统相较于Android系统的优势
- Oracle执行计划 讲解(一)
- Shell自动化脚本整理
- SketchUp Vray 批量渲染图片
- Rails
- 百度地图的集成
- cdn加速的搭建
- Unity内置的Shader打包时丢失
- SQL学习笔记14——子查询
- 3139 栈练习3
- CSS3 函数技巧 用css 实现js实现的事情
- 汇编 AX, BX, CX, DX, SI, DI,
- Git基本命令