Rails
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 25638
Accepted: 10068
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.
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
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
Source
Central Europe 1997
题目大意：如上图所示，已知火车要从A入站，然后从C出站。火车进站的
顺序为1~N，现在给你出站的顺序。问：能不能通过站台改变火车出站顺序
来实现按所给顺序出站。
思路：把站台看做是一个栈，按1~N的顺序遍历火车原先顺序，先入栈，如
果栈顶的火车编号和所给出站顺序将要出站的编号一样。那么火车就出栈，
直到栈里边所有满足出站顺序的火车都出站，否则就一直入栈。最后判断所
有火车是否都出站了。若都出站，输出Yes，否则输出No。
#include<cstdio>
#include<string.h>
#include<stack>
using namespace std;
const int MAXN = 1010;
stack<int> s;
int train[MAXN];
int main()
{
int N;
while(~scanf("%d",&N) && N)
{
while(scanf("%d",&train[1]) && train[1])
{
for(int i = 2; i <= N; i++)
scanf("%d",&train[i]);
int B = 1;
for(int i = 1; i <= N; i++)
{
s.push(i);
while(!s.empty() && s.top() == train[B])
{
s.pop();
B++;
}
}
if(B == N+1)
printf("Yes\n");
else
printf("No\n");
memset(train,0,sizeof(train));
}
printf("\n");
}
return 0;
}