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 Specificatio

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

思路

这题本身并不难，代码实现也很简单，关键是要理解题目意思，题目要求按顺序push， 然后随机pop，我英语水平很差，所以题目是机翻的，机翻过来的很难很难理解，卡壳很长时间，理解这一步题目也就迎刃而解。

每一次push都可能pop，并且pop可能不只一次

代码

#include <stdio.h>
#include <stdlib.h>
typedef struct SNode* Stack;
struct SNode {
	int data[1010];
	int top;
};
void push(Stack ptrl, int a);
void pop(Stack ptrl);
int main()
{
	Stack ptrl;
	ptrl = (Stack)malloc(sizeof(struct SNode));
	ptrl->top = -1;
	int m, n, k, i, j = 0;
	scanf("%d %d %d", &m, &n, &k);
	int b[1010];
	while (k--) {
		ptrl->top = -1;
		j = 0;
		for (i = 0; i < n; i++) {
			scanf("%d", &b[i]);
		}
		for (i = 1; i <= n; i++) {
			push(ptrl, i);
			if (ptrl->top >= m) {
				break;
			}
			while (ptrl->top != -1 && ptrl->data[ptrl->top] == b[j]) {
				j++;
				pop(ptrl);
			}
			
		}
		if (ptrl->top == -1) {
			printf("YES\n");
		}
		else {
			printf("NO\n");
		}
	}
}
void push(Stack ptrl, int a) 
{
	ptrl->data[++(ptrl->top)] = a;
	return;
}
void pop(Stack ptrl)
{
	ptrl->top--;
	return;
}