7-1 Pop Sequence (6 分)

7-1 Pop Sequence (6 分)

题干

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
结尾无空行

思路

刚开始看到这个题一脸蒙，因为我开始一直以为是有一个现有的栈是1234567，然后对这个栈进行操作。
其实是在1234567是一个个入栈的，遇到结果里的就输出，判断会不会矛盾。
我这里用了一个tmp和两个数组，一个是a[](需要判断的数组)，一个是b[](记录现在的栈)
比如样例里5643721是可以的，第一个出栈的是5（如下图所示），此时b[]应该让5出栈，pb指向4，然后pa++，发现此时pa指向的6 并不是b的栈顶，于是继续读tmp（6），入栈后，此时三个元素可以出栈（循环判断），是643，再读入7，然后b[]就是127，7为栈顶，出栈顺序721，因此这个是YES.
注意题目里面M是有限制的，比如这里如果5没有出栈，b[]内就有六个元素了，就应该直接报NO结束判断。

Code

#define