浙大慕课数据结构练习题 线性结构 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.

算法描述 T(n)=O(n²)：首先，为了方便，每输入一组数据a就处理一组数据。整体上，每当数据符合出栈(stack)要求，就将数据存入另一个数组c，最终比较数组a和c是否相等即可。
先不考虑数组c什么时候完成存储操作的循环。先看循环体内，首先，每次循环当栈内没有元素时必须入栈，然后需要判断栈顶和数组a下标(posit)对应的值相等与否，如果stack[top]<a[0]，则元素入栈；如果stack[top]==a[posit]，则stack[top]存入c[0]，top–，num++；如果stack[top]>a[0]，说明不存在这种排序，退出循环。因此循环的判断条件是posit<m（元素个数）和top<n（栈的大小）。
代码如下：

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int stack[1000],a[1000],n,m,k;
int main(void) {
	scanf("%d%d%d",&n,&m,&k);
	for(int i=0; i<k; i++) {
		for(int j=0; j<m; j++) {
			scanf("%d",&a[j]);
		}
		int top=-1,num=1,posit=0,c[1000],cnt=0;
		int ret=1;
		while(posit<m&&top<n) {
			if(top==-1) {
				stack[++top]=num++;
			}
			if(a[posit]>stack[top]) {
				stack[++top]=num++;
			}
			else if(a[posit]==stack[top]) {
				c[cnt++]=stack[top--];
				posit++;
			}
			else {
				ret=0;
				break;
			}
		}
		if(ret) {
			for(int j=0; j<m; j++) {
				if(c[j]!=a[j]) {
					ret=0;
					break;
				}
			}
		}
		if(ret) printf("YES");
		else printf("NO");
		if(i!=k-1) printf("\n");
	}
	return 0;
}