Rails

链接：登录—专业IT笔试面试备考平台_牛客网
来源：牛客网
 

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.

输入描述:

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.

示例1

输入

5

1 2 3 4 5

5 4 1 2 3

0

6

6 5 4 3 2 1

0

0

输出

Yes
No

Yes

 题目大意

火车由A进站由B出站，大概意思就是把车站看作一个栈，A是一组由1到n的 数字，B是一个空容器，A中的元素可以随时进栈，栈中的元素可以随时出栈进入B，现在给出 一组排好的序列，判断该序列是否是一个合法的序列（是否可以由 A中的元素进栈出栈后在B中合成）。

代码实现

#include<iostream>
#include<stack>

using namespace std;
const int N=1010;
stack<int>k;
int a[N],b[N];
int n,m;

int main(){
	while(scanf("%d",&n),n){
		while(scanf("%d",&m)){
			if(!m){
				cout<<endl;
				break;
			}
			for(int i=2;i<=n;i++)cin>>a[i];
			a[1]=m;
			int c=1;
			k.push(0);
			for(int i=1;i<=n;i++){
				while(a[c]==k.top()&&c<=n){
					c++;
					k.pop();
			    }
				if(a[c]==i){
					c++;
					continue;
				}else{
					k.push(i);
				}
			}
			while(a[c]==k.top()&&c<=n){
					c++;
					k.pop();
			}	
			if(!k.top())cout<<"Yes"<<endl;
			else cout<<"No"<<endl;
		}
		
	}
	return 0;
}