02-线性结构4 Pop Sequence（25 分)

最新推荐文章于 2022-03-17 23:04:25 发布

原创

最新推荐文章于 2022-03-17 23:04:25 发布 · 2.4k 阅读

5 ·

CC 4.0 BY-SA版权

文章标签：

#C语言 #PTA

本文介绍了一种算法，用于验证给定序列是否为一个有限容量堆栈的有效弹出序列。通过使用堆栈和队列数据结构，算法检查一系列数字是否能从特定大小的堆栈中正确弹出。

02-线性结构4 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

#include <stdio.h>
#include <stdlib.h>
#define MAXN 1001


// 栈部分
typedef struct SqStack {
   
   
	int Data[MAXN];
	int Top;
}*Stack;

Stack initStack(void) {
   
   
	Stack S = (Stack)malloc(sizeof(struct SqStack));
	S->Top = 0;
	return S;
}

int getLength(Stack S) {
   
   
	return S->Top;
}

int