PAT A1051

 以前的

#include<stack>
#include <iostream>
#include<string>
#include<queue>
using namespace std;
int M, N, K;
int cnt=1;
bool flag = true;

void Cando(queue<int>q)
{
	stack<int>s;
	cnt = 0;
	int cnum = 1;
	while(!q.empty())
	{
		int cur = q.front();
		q.pop();
		flag = true;
		while (flag) {
			if (!s.empty() && s.top() == cur)
			{
				s.pop();
				cnt--;
				flag = false;
			}
				else {
					if (s.empty() || s.top() < cur) {
						if (cnt < M)
						{
							s.push(cnum);
							cnum++;
							cnt++;
						}
						else {
							printf("%s\n", "NO");
							return;
						}
					}
					else {
						printf("%s\n", "NO");
						return;
					}
				}
		}
		
	}
	printf("%s\n", "YES");
	return;
}
int main()
{
	scanf("%d %d %d", &M, &N, &K);
	for (int i = 0; i < K; i++)
	{
		queue<int>q;
		for (int j = 0; j < N; j++)
		{
			
			int num;
			scanf("%d", &num);
			q.push(num);

		}
		Cando(q);
	}
}

#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<bits/stdc++.h>

using namespace std;

int main()
{
	
	
	int M, N, K;
	scanf("%d %d %d", &M, &N, &K);
	for (int i = 0; i < K; i++)
	{
		vector<int> ans;
		for (int j = 0; j < N; j++)
		{
			int num;
			scanf("%d", &num);
			ans.push_back(num);
		}
		int num = 1;
		stack<int>s;
		bool yes = true;
		for (int j = 0; j < N&&yes; j++)
		{
			while (s.size()==0||ans[j] != s.top())
			{
				if (num <= N && s.size() < M)
				{
					s.push(num);
					num++;
				}
				else {
					yes = false;
					break;
				}
			}
			if(yes)
				s.pop();
		}
		if (i > 0)
			printf("\n");
		if (yes)
		{
			printf("YES");
		}
		else {
			printf("NO");
		}


	}

	return 0;
}