模拟出栈序列

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int main()
{
	int m, n, k;
	scanf("%d%d%d", &m, &n, &k);
	int a[1001], b[1001];
	a[0] = -1;
	while (k--)
{
	for (int i = 0; i < n; i++)
		scanf("%d", &b[i]);
	    int out; 
		int top = 0;
		int temp = 1,flag=0;
		for (out=1;out<= m; out++)
		{
			if(temp<=n)
			a[out] = temp++;//a[out]储存入栈元素
			while (a[out] == b[top])
			{ 
				//如果入栈元素等于出栈元素，该元素不入栈，并且再将栈顶元素与待出栈元素的下一个比较
				out--;
				top++;
			}
			if (top==n)
			{
				printf("YES\n");
				flag = 1;
				break;
			}
		}
		if (flag == 1)
		{
			flag = 0;
			continue;
		}
		printf("NO\n");
}
}