UVA514 铁轨

用vector声明B轨道，用stack声明c轨道，依次将a赋值为1,2,3,4,5...即为从a轨道驶出的货车。然后进行四项判断，

要进站的火车与要出站的火车为同一辆，则进站后直接出站；

栈（站）非空，栈顶与要出站的火车相同，则出站；

要进站的与出站的不同，只进站，先等着，当栈顶与目标相同时再出；

若前几种情况都不符合，则不能按照要求顺序出站，break 。

#include<iostream>
#include<stack>
#include<vector>
using namespace std;
vector <int> b;
int main()
{
	int n,k,i,a,nb,ok;
	while(cin>>n)			//输入 
	{
		while(1)
		{
			stack <int> c;
			b.clear();
			cin>>k;
			if(k==0)
			break;
			b.push_back(k);
			for(i=2;i<=n;i++)
			{
				cin>>k;
				b.push_back(k);
			}
			a=1;nb=0;
			while(nb<n)			//进行判断 
			{
				ok=1;
				if(b[nb]==a)	//要进站的火车与要出站的火车为同一辆，则进站后直接出站
				{
					a++;
					nb++;
				}
				else if(!c.empty()&&c.top()==b[nb])	//栈（站）非空，栈顶与要出站的火车相同，则出站
				{
					c.pop();
					nb++;
				}
				else if(a<=n)		 //要进站的与出站的不同，只进站，先等着，当栈顶与目标相同时再出
				c.push(a++);
				else				//若前几种情况都不符合，则不能按照要求顺序出站，break 
				{
					ok=0;
					break;
				}
			}
			if(ok)
			cout<<"yes"<<endl;
			else
			cout<<"no"<<endl;
		}
	}
	return 0;
}
 

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 hascoaches numbered in increasing order.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.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 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 integerNdescribed above.In each of the next lines of the block there is a permutation ofThe 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 containsYesif it is possible to marshal the coaches in the order required on the corresponding line of the input file.Otherwise it containsNo.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