Description
There is a famous railway station in PopPush City. Country there is incredibly hilly. Thestation was built in last century. Unfortunately, funds were extremely limited that time. It waspossible to establish only a surface track. Moreover, it turned out that the station could be only adead-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 has
coaches numbered in increasing order
.The chief for train reorganizationsmust know whether it is possible to marshal coaches continuing in the direction B so that theirorder will be
.Help him and write a program that decides whether it is possible toget the required order of coaches. You can assume that single coaches can be disconnected from thetrain before they enter the station and that they can move themselves until they are on the trackin the direction B. You can also suppose that at any time there can be located as many coaches asnecessary in the station. But once a coach has entered the station it cannot return to the track inthe direction A and also once it has left the station in the direction B it cannot return back to thestation.
![\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}](http://uva.onlinejudge.org/external/5/p514.gif)
![$N \leŸ 1000$](http://uva.onlinejudge.org/external/5/514img2.gif)
![$1, 2, \dots, N$](http://uva.onlinejudge.org/external/5/514img3.gif)
![$a_1. a_2, \dots, a_N$](http://uva.onlinejudge.org/external/5/514img4.gif)
Input
The input file consists of blocks of lines. Each block except the last describes one train andpossibly 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
Thelast line of the block contains just 0.The last block consists of just one line containing 0.
![$1, 2, \dots, N$](http://uva.onlinejudge.org/external/5/514img3.gif)
Output
The output file contains the lines corresponding to the lines with permutations in the inputfile. A line of the output file contains
Yes if it is possible to marshal the coaches in the orderrequired on the corresponding line of the input file. Otherwise it contains
No. In addition, there isone empty line after the lines corresponding to one block of the input file. There is no line in theoutput file corresponding to the last ``null'' block of the input file.
Sample Input ![](http://acm.wust.edu.cn/image/copy.gif)
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
分析:从A经过C转到B,B是目标序列,C是栈,A是从1到n的顺序列,每次判断A和B是否相等,否则判断C和B是否相等
#include <iostream>
#include <stack>
#include <cstdio>
using namespace std;
const int maxn = 1010;
int posible[maxn];
int main()
{
int n; int first = 1;
while(~scanf("%d",&n)&&n)
{
while(~scanf("%d",&posible[1])&&posible[1])
{
stack<int> stk;
for(int i=2; i<=n; i++) scanf("%d",&posible[i]);
int yes = 1;
int A = 1,B = 1;
while(B<=n)
{
if(A==posible[B]) {A++; B++;}
else if(!stk.empty() && stk.top()==posible[B]){stk.pop();B++;}
else if(A<=n){stk.push(A++);}
else {yes=0; break;}
}
printf("%s\n",yes?"Yes":"No");
}
putchar('\n');
}
return 0;
}