02-线性结构4 Pop SequenceReversing Linked List (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<malloc.h>
typedef struct snode* Stack;

struct snode{
	int *data;
	int top;
	int maxsize;
}; 

int main(){
	Stack S;
	int n, k, m;
	int i, j;
	int temp;
	int A[1004];
	S = (Stack)malloc(sizeof(struct snode));
	scanf("%d%d%d",&m, &n, &k);
	S->maxsize = m;
	S->data = (int*)malloc(sizeof(int)*(m+2));
	S->top = -1;
	for ( i = 0; i < k ; i++){
		S->top = -1;
		int a = 1;
		for ( j = 0; j < n; j++)
			scanf("%d",&A[j]);
		j = 0;
		while(a != n+1 || S->top != -1){
			while(S->top == -1 || S->data[S->top] < A[j] ){
				S->top++;
				S->data[S->top] = a;
				a++;
				if(S->top == S->maxsize){
					printf("NO\n");
					break;
				}
			}
			if(S->top == S->maxsize){
					break;
				}
			if(S->data[S->top] == A[j])
				S->top--;
			if (S->top != -1)
			if(S->data[S->top] > A[j]){
				printf("NO\n");
				break;
			}
			if (S->top == -1 && a == n+1)
				printf("YES\n");
			j++;
		}
	}
	
}