浙大版《数据结构（第2版）》题目集--Pop Sequence

题目

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.

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

题目意思是 给一个入栈 序列 1 .2.3…N,栈的大小设为M,测试输出序列个数为K，要求判断输出序列的合法性。输入样例第一行为 M、N、K，其余行数为需要检验的出栈序列共K个 。这道题考察的是栈的基本操作和概念，判断的关键在于栈顶元素和将要出栈的元素进行比较
1：栈不为空且不溢出且栈顶元素小于将要比较的出栈元素，或者栈为空并且还有元素没有进栈，
以上情况进行入栈操作
2：栈不为空且栈顶元素等于将要进行比较的出栈元素
以上情况进行出栈操作
3：栈不为空但是栈顶元素大于将要比较的出栈元素，或者栈满且栈顶元素和将要比较的出栈元素还不相等
以上情况代表给定序列不合法 输出NO.

代码

// Pop Sequence.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include<stdlib.h>
#include<iostream>
using namespace std;
int M, N, K;
typedef struct Node
{
   
	int *Data;
	int Top;
	
}* Stack;

Stack creatStack()
{
     
	Stack S = (Stack)</