PAT 甲级 1051 Pop Sequence (25 分)

题目描述

Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, …, N and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of the stack. For example, if M is 5 and N is 7, we can obtain 1, 2, 3, 4, 5, 6, 7 from the stack, but not 3, 2, 1, 7, 5, 6, 4.

输入

Each input file contains one test case. For each case, the first line contains 3 numbers (all no more than 1000): M (the maximum capacity of the stack), N (the length of push sequence), and K (the number of pop sequences to be checked). Then K lines follow, each contains a pop sequence of N numbers. All the numbers in a line are separated by a space.

输出

For each pop sequence, print in one line “YES” if it is indeed a possible pop sequence of the stack, or “NO” if not.

思路

这道题大家应该不陌生，在数据结构的考试里都应该见过，那么程序该怎么判断呢。
我们可以想一下，由于1 2 3 4 5…这样放入，所以当i准备放入时，这个时候1-i-1已经放进去过，因此stack的头不可能出现大于i，所以在输出序列我们可以这样考虑，当前stack的头为i，此时输入序列为j，若i==j则说明刚好这个数被弹出了，若j>i,说明i+1-j这几个数是放进去还没弹出时，因此将这几个数放入。若j<i则出错。中途放入判断一下有没有超过最大限量即可。

代码

#include<iostream>
#include<cstdio>
#include<stdlib.h>
#include<stack>
using namespace std;
int main()
{
	int N, M, K;
	cin >> M >> N >> K;
	while (K--)
	{
		stack<int> in;
		int pan[1100] = { 0 };
		int sequ[1100];
		for (int i = 0; i < N; i++)
		{
			cin >> sequ[i];
		}
		int flag = 1;
		for (int i = 0; i < N; i++)
		{
			if (flag == 0)
			{
				break;
			}
			int top = 0;
			if (!in.empty())
			{
				top = in.top();
			}
			if (top == sequ[i])
			{
				in.pop();
				pan[top] = 2;
			}
			else if(top<sequ[i])
			{
				
				for (int j = top + 1; j <= sequ[i]; j++)
				{
					if (pan[j] == 0)
					{
						pan[j] = 1;
						in.push(j);
					}
				}
				if (in.size() > M)
				{
					flag = 0;
				}
				in.pop();
			}
			else
			{
				flag = 0;
			}
		}
		if (flag)
		{
			printf("YES\n");
		}
		else
		{
			printf("NO\n");
		}
	}
}