数据结构 Pop Sequence

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define Maxsize 1000//最大容量
typedef struct Node{
	int Top;//栈顶
	int Data[Maxsize];//元素
	int Capacity;//容量
}*Stack;

int IsPopPossible(int Arry[],int M,int N);//判断是否可能为出栈序列 
int main()
{
	int M = 0,N = 0,K = 0,i = 0,j = 0;
	scanf("%d %d %d",&M,&N,&K);//条件读入 
	int Arry[N];//数据存储 
	for(i = 0;i <= K-1;i++){
		for(j = 0;j <= N-1;j++)//每一行数据读入 
			scanf("%d",&Arry[j]);
		if(IsPopPossible(Arry,M,N))//非零时表示可能存在 
			printf("YES\n");
		else 
			printf("NO\n");
	}
	return 0;
}
int IsPopPossible(int Arry[],int M,int N)
{
	int i = 0,flag = 0,count = 0;
	Stack Pile = (Stack)malloc(sizeof(struct Node));//申请并初始化一个空栈 
	Pile->Capacity = M;
	Pile->Top = -1;
	for(i = 1;i <= N;i++){
		if(Pile->Capacity == Pile->Top+1)//栈满 
			return 0;
		else
			Pile->Data[++Pile->Top] = i;//入栈 
		while(Pile->Data[Pile->Top] == Arry[count]){//比较栈顶是否与某数相等 
			Pile->Top--;//出栈 
			count++;//数组往后移位   //这句是精髓
		}
	}
	if(count == N)//全部找到并且输出时 
		return 1;
	else 
		return 0; 
}