poj 1363 Rails 【栈】



Rails

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 27587		Accepted: 10741

Description

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

栈的应用： 按照原顺序依次进栈，进栈的同时进行判断，看栈顶元素和出站的第一顺序是否相同，相同栈顶元素出栈并且出站第一顺序递增到下一位，直到不等继续下次进栈。最后判断栈是否为空即可。

用数组模拟栈实现：（不好理解看下一个）

#include <cstdio>
int a[1010], b[1010];
int main()
{
	int n;
	int t, i, j;
	while(scanf("%d", &n), n)
	{ 
		while(scanf("%d", &b[0]), b[0])
		{
			for(i = 1; i < n; i++)
			scanf("%d", &b[i]);
			t = 0;
			for(i = 1, j = 0; i <= n; i++)
			{
				a[t++] = i;
				while(t >= 0 && a[t-1] == b[j])
				{
					j++;//出战顺序到下一位 
					t--;//栈顶元素出栈 
				}
			} 
			if(t <= 0)//为空 
			printf("Yes\n");
			else
			printf("No\n");
		}
		printf("\n"); 
	}
	return 0;
} 

STL栈实现：

#include <cstdio>
#include <stack>
using namespace std;
int a[1010], b[1010];
int main()
{
	int n;
	int t, i, j;
	while(scanf("%d", &n), n)
	{ 
		while(scanf("%d", &b[0]), b[0])
		{
			for(i = 1; i < n; i++)
			scanf("%d", &b[i]);
			stack<int> s;
			for(i = 1, j = 0; i <= n; i++)
			{
				s.push(i);
				while(!s.empty() && s.top() == b[j])//栈不为空 
				{
					j++;
					s.pop();
				}
			} 
			if(s.empty())//栈为空 
			printf("Yes\n");
			else
			printf("No\n");
		}
		printf("\n"); 
	}
	return 0;
}