【PAT】A-1051 Pop Sequence【栈】

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

题意

给定M、N、K三个参数。现有一个序列{1,2,…N}，栈的最大容量为M，对于K组查询中的每个查询，判断是否能够仅通过入栈和出栈两种操作得到该组查询的出栈顺序，可以输出"YES"，否则输出"NO"。

思路

按顺序考虑一组查询中的每个元素，对于某一元素t和下一进栈元素next：

• 如果t=next，则判断栈是否还有空间，有则入栈再出栈（实际上可以省略这一过程，因为入栈之后马上出栈，栈没有发生变化，但此时next需要加1）。
• 如果t<next，则说明t已经在栈中，判断栈顶元素是否等于t。
• 否则t>next，不断入栈直到栈满或者next==t，这时候同第一种情况，判断栈是否还有空间，有则入栈再出栈。

为了方便，对任一组查询，我们设置布尔变量skip，初始化为false。如果无法满足某一出栈元素t，则将skip置为false。这样读取下一个元素时如果skip为true，则跳过判断过程（因为有一个元素不符合，