POJ1363 Rails && c++ stack容器简单使用

stack容器介绍：stack(堆栈）是一个容器的改编，它实现了一个先进后出的 数据结构（FILO）

使用该容器时需要包含#include<stack>头文件；

定义stack对象的示例代码如下：

stack<int>s1;

stack<string>s2;

stack的基本操作有：

1.入栈：如s.push(x);

2.出栈:如 s.pop().注意：出栈操作只是删除栈顶的元素，并不返回该元素。

3.访问栈顶：如s.top();

4.判断栈空：如s.empty().当栈空时返回true。

5.访问栈中的元素个数，如s.size（）;

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.

Output

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.

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

问题：就是打A呢边来了列火车，现在要求以B这边的顺序开出去...问能不能做到...

分析：把车站看成一个栈...不断把A这边的元素压入栈中...如果栈顶和B给的顺序相同就把这节车厢取出...最后只要如果栈里没有元素了...车全开出去就是yes...

#include<iostream>
#include<stack>
#include<cstdio>
#include<string.h>
using namespace std;
stack<int> station; //把火车站当成栈 
int train[1005];

int main(){
	int n;
	while(scanf("%d",&n) != EOF && n){
		while(scanf("%d",&train[1]) && train[1]){
			for(int i=2;i<=n;i++){
				scanf("%d",&train[i]); //输入出站顺序 
			}
			int NUM=1;
			for(int j=1;j<=n;j++){
				station.push(j);//进站 
				while(!station.empty()&&station.top()==train[NUM]){ //判断是否栈空... 是否有车符合出站条件 
					station.pop();
					NUM++;
				}
			}
			if(NUM==n+1) printf("Yes\n");
			else printf("No\n");
			memset(train,0,sizeof(train));//清空出站顺序 
		}
		printf("\n");
	}
	return 0; 
}