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.Input
The input file 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 file contains the lines corresponding to the lines with permutations in the input file. A line of the output file contains Yes if it is possible to marshal the coaches in the order required on the corresponding line of the input file. Otherwise it contains No. In addition, there is one empty line after the lines corresponding to one block of the input file. There is no line in the output file corresponding to the last ``null'' block of the input file.
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
此题是对的简单模拟,注意输入输出格式。
附代码如下:
#include<cstdio>
#include<cstring>
#include<stack>
using namespace std;
#define CLR(x,y) (memset(x,y,sizeof(x)))
#define MAXN (1000+5)
int a[MAXN];
int main(){
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int n;
while(scanf("%d",&n)==1&&n){
CLR(a,0);
while(scanf("%d",&a[1])==1&&a[1]){
for(int i=2;i<=n;i++)scanf("%d",&a[i]);
stack<int> s;
int A=1,B=1;
bool flag=true;
while(B<=n){
if(A==a[B]){
A++;B++;
}else if(!s.empty()&&s.top()==a[B]){
s.pop();
B++;
}else if(A<=n){
s.push(A);
A++;
}else{
flag=false;
break;
}
}
if(flag)printf("Yes\n");else printf("No\n");
}
printf("\n");
}
//fclose(stdout);
//fclose(stdin);
return 0;
}