PTA-数据结构 编程题02-线性结构4 Pop Sequence (25 分)

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 maxsize 1000

typedef struct node *Node;
struct node{
	int num;
	int top;
	int data[maxsize];
};

Node CreatNode( int M )   //栈初始化
{
	Node s =( Node )malloc( sizeof( struct node ) );
	s->top = -1;
	s->num = M;
	return s;
 } 
 
 int Push( Node s, int x ) //入栈 
 {
 	if( s->num == s->top+1 )	return 0;
 	else
 	{
 		s->data[ ++ s->top ] = x;
 		return 1; 
	  } 
 }
 
void Pop( Node s )  	//出栈 
{
	s->top--;
} 

int Get_Top( Node s )	//返回栈顶元素 
{
	if(s->top >= 0)		return s->data[s->top];
	else		return -1;		
}

int IsPossible( int pop[], int M, int N)
{
	Node s = CreatNode( M );
	int i;
	int n = 0;
	for( i = 1; i <= N; i++ )
	{
		if( !Push( s, i ) )		return 0;
		while( Get_Top( s ) == pop[n] )
		{
			Pop( s );
			n++;
		}
	}
	if( n == N )	return 1;
	else 			return 0;
}

int main()
{
	int M, N, K;  	//M = 栈的最大容量   N = 进栈的数字序列长度    K = 被检查的出栈序列数
	int i, j;
	
	scanf( "%d %d %d", &M, &N, &K);
	
	int pop[N]; 	//出栈测试 
	
	for( i = 0; i < K; i++ )
	{
		for( j = 0; j < N; j++ )   //读取输入的数 
		{
			scanf( "%d",&pop[j]) ;
		}	
		if( IsPossible( pop, M, N ) )	printf("YES\n");
		else			printf("NO\n");
	}
	
	return 0;
}