nowcoder NC14326 Rails

题目来源

目录

题意描述

输入描述:

输出描述:

输入

输出

 stack 的基本用法

解题思路

实现代码及注释

---

题意描述

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

 stack 的基本用法

类似于弹夹中的子弹一样先进去，却要后出来，而后进去，反而可以先出来的数据结构——栈。

stack的基本操作：

解题思路

 将数组中的元素从a[1] 开始与1~n个数按从小到大的顺序进行对比，若 a[l] 不等于该数，则将该数压入栈中，若相同，则 l++；若不相同，再判断a[l] 与栈顶元素是否相同，当栈为空时，说明元素都能匹配，否则就说明不能实现。

实现代码及注释

#include<iostream>
#include<stack> 
int a[1005];
using namespace std;
int main()
{
	int n;
	while(scanf("%d",&n),n)//输入n，若n不为0
	{
		while(scanf("%d",&a[1]),a[1])//判断a1是否为0，若为0，则结束
		{
			for(int i=2;i<=n;i++)
			{
				cin>>a[i];
			}
			int l=1;
			stack<int> sta;//定义一个sta栈
			for(int i=1;i<=n;i++)
			{
				if(a[l]!=i)
				{
					sta.push(i); //若不符合，则将i压入栈中
				}
				else
				{
					l++;  //若相等，则找下一个
				}
				while(!sta.empty()&&sta.top()==a[l]) //判断栈顶元素是否符合
				{
					sta.pop();//若符合，则弹出栈顶元素
					l++; 
				}
			}
			if(sta.empty())//若栈为空
			{
				cout<<"Yes"<<endl;
			}
			else
			{
				cout<<"No"<<endl;
			}
		}
        cout<<endl;
	}
	return 0;
}