https://pintia.cn/problem-sets/994805046380707840/problems/1111914599412858889

题解：栈+队列

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
#define endl "\n"
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,p,l,r,u,v;
int ans,cnt,flag,temp,sum;
int a[N];
char str;
struct node{};
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    //cout.tie(0);
    //scanf("%d",&t);
    //while(t--){
    scanf("%d%d%d",&n,&m,&k);
    while(k--){
        stack<int>st;
        int pos=1;
        queue<int>q;
        for(int i=1;i<=n;i++){
            scanf("%d",&p);
            q.push(p);
        }
        flag=1;
        while(pos<=n){
            if(!st.empty()){
                if(pos==st.top()){
                    st.pop();
                    pos++;
                    continue;
                }
            }
            if(!q.empty()){
                if(pos==q.front()){
                    pos++;
                    q.pop();
                    continue;
                }else{
                    temp=q.front();
                    q.pop();
                    st.push(temp);
                    if(st.size()>m){
                        flag=0;
                        break;
                    }
                }
            }else {
                flag=0;
                break;
            }
        }
        cout<<(flag?"YES":"NO")<<endl;
    }
    //}

#ifdef DEBUG
	printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
    //cout << "Hello world!" << endl;
    return 0;
}