There is a famous railway station in PopPush City. Country there is incredibly hilly. The stationwas built in last century. Unfortunately, funds were extremely limited that time. It was possible toestablish 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 directionB with coaches reorganized in some way. Assume that the train arriving from the direction A hasN ≤ 1000 coaches numbered in increasing order 1, 2, . . . , N. The chief for train reorganizations mustknow whether it is possible to marshal coaches continuing in the direction B so that their order willbe a1.a2, . . . , aN . Help him and write a program that decides whether it is possible to get the requiredorder of coaches. You can assume that single coaches can be disconnected from the train before theyenter the station and that they can move themselves until they are on the track in the direction B. Youcan 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 onceit has left the station in the direction B it cannot return back to the station.InputThe input file consists of blocks of lines. Each block except the last describes one train and possiblymore requirements for its reorganization. In the first line of the block there is the integer N describedabove. In each of the next lines of the block there is a permutation of 1, 2, . . . , N. The last line of theblock contains just ‘0’.The last block consists of just one line containing ‘0’.OutputThe output file contains the lines corresponding to the lines with permutations in the input file. A lineof the output file contains ‘Yes’ if it is possible to marshal the coaches in the order required on thecorresponding line of the input file. Otherwise it contains ‘No’. In addition, there is one empty line afterthe lines corresponding to one block of the input file. There is no line in the output file correspondingto the last “null” block of the input file.Sample Input51 2 3 4 55 4 1 2 3066 5 4 3 2 100Sample OutputYesNoYes
分析:
很明显用栈来模拟车进出的情况,设两个指针A,B分别指向顺序的情况(1-N)和输入的情况逐一判断。
代码如下:
#include<iostream>
#include<cstdio>
#include<stack>
#include<cstring>
using namespace std;
int target[1003];
int main(){
int n,a;
while(scanf("%d",&n)!=EOF){
if(n==0)break;
memset(target,0,sizeof(target));
while(1){
stack<int> q;
scanf("%d",&a);
if(a==0)break;
else target[1]=a;
int A=1,B=1,flag=1;
for(int i=2;i<=n;i++){
scanf("%d",&target[i]);
}
while(B<=n){
if(A==target[B]){A++;B++;}
else if(q.size()&&q.top()==target[B]){q.pop();B++;}
else if(A<=n)q.push(A++);
else {flag=0;break;}
}
printf("%s\n",flag?"Yes":"No");
}
printf("\n");
}
}