PAT_Advanced Level_1051 Pop Sequence(C++_模拟_STL)

最新推荐文章于 2020-04-19 17:02:49 发布

原创最新推荐文章于 2020-04-19 17:02:49 发布 · 234 阅读

0 ·

CC 4.0 BY-SA版权

传统算法专栏收录该内容

383 篇文章

订阅专栏

本文介绍了一个编程问题，涉及栈的数据结构。任务是判断给定的出栈序列是否可以通过一系列合法的入栈和出栈操作得到，考虑到栈的最大容量限制。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Input Specification:

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.

Output Specification:

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

Sample Input:

5 7 5
1 2 3 4 5 6 7
3 2 1 7 5 6 4
7 6 5 4 3 2 1
5 6 4 3 7 2 1
1 7 6 5 4 3 2

Sample Output:

YES
NO
NO
YES
NO

Process

这个题问题应该出在对题意的理解上面，这道题的意思是一个栈有m个位置，有n个数待入栈，允许一边入栈一边出栈，但一个数只能入栈一次，出栈的时候就要被输出，最终输出的顺序是否可以达到题中所给的顺序。过程模拟起来倒是很简单哈。

Code

#include<bits/stdc++.h>
using namespace std;
int n, m, cnt, a[1010];
int main()
{
	cin >> n >> m >> cnt;
	for (int i = 0; i < cnt; i++)
	{
        int num=0;
		stack<int> v;
		for (int j = 0; j < m; j++)
			cin >> a[j];
		for (int j = 1; j <= m; j++)
		{
			v.push(j);
			if (v.size() > n)
				break;
			int t = v.top();
			while (!v.empty() && v.top() == a[num])
			{
				t = v.top();
				v.pop();
				num++;
			}
		}
		if (num == m)
			cout << "YES" << endl;
		else
			cout << "NO" << endl;
	}
	return 0;
}