# Rails

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 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 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.样例输入
5
1 2 3 4 5
5 4 1 2 3
0
6
6 5 4 3 2 1
0
0

Yes
No

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iomanip>
using namespace std;
int a[1005]={},s[1005]={};
int main()
{
int n,top;
while(cin>>n)
{
int t=1;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=n;i++)
{
if(a[t]!=i)  s[++top]=i;
else t++;
while(top && s[top]==a[t]) top--;
t++;
}
if(!top) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}

return 0;
}

• 本文已收录于以下专栏：

## agile web development with rails 5(英文电子书)

• 2017年11月30日 12:22
• 14.69MB
• 下载

## inspinia admin - v2.5 Rails_Seed_Project

• 2016年08月24日 12:06
• 1.84MB
• 下载

## Rails Web应用开发实战－学生选课系统基础版（二）

Rails Web应用开发实战－学生选课系统基础版（二）在上一篇教程中，我们在Cloud9中跑通了整个演示代码，下面我们将从零建立一个新的Rails应用。在我们写代码之前，我们先看看Rails框架的结...

## rails入门详细笔记

• 2016年05月23日 16:31
• 294KB
• 下载

## Rails, Angular, Postgres, and Bootstrap(2nd) epub

• 2017年10月07日 01:33
• 5.37MB
• 下载

## rails学习笔记: rake db 相关命令

rails学习笔记: rake db 命令行 rake db：***** script/generate model task name:string priority:integer scri...

## Ruby on Rails

• 2015年04月09日 10:02
• 649KB
• 下载

## Ruby on Rails Web随书光盘(源代码)

• 2017年05月20日 19:52
• 34.02MB
• 下载