02-线性结构4 Pop Sequence

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.

#include <iostream>
#include<string>
#include<cstdlib>
using namespace std;

//struct内成员顺序必须这样,不然不能在PAT上正确运行(草,不知道为什么,自己的g++编译器都可以过)
struct SNode {
	int Top = -1;       
	int Data[1000];
	int Capacity = 0;
};
typedef struct SNode* Stack;
int Check(int a[], int M, int N);

int main()
{
	int M = 0, N = 0, K = 0, i = 0, j = 0;
	int a[1001] = { 0 };
	cin >> M >> N >> K;

	for (i = 0; i <= K - 1; i++) {
		for (j = 0; j <= N - 1; j++) {
			cin >> a[j];            //读入元素到数列
		}
		if (Check(a, M, N)) {
			cout << "YES" << endl;
		}
		else {
			cout << "NO" << endl;
		}
	}

	return 0;
}

int Check(int a[], int M, int N)
{

	int i = 0, j = 0;
	Stack S = (Stack)malloc(sizeof(struct SNode));
	S->Capacity = M;        //写入容量
	S->Top = -1;            //栈顶Top指针

	for (i = 1; i <= N; i++) {      //从1开始到N
		if (S->Capacity == S->Top + 1) return 0;    //栈满则直接return0
		else S->Data[++S->Top] = i;			//顺序压入堆栈
		while (S->Data[S->Top] == a[j]) {	//数组中有元素相等依次出栈
			S->Top--;		//出栈
			j++;			//数组后移
		}
	}

	if (j == N) return 1;
	else return 0;
}