#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int main()
{
cin >> n >> m >> k;
while(k--)
{
int cnt = 1;
bool flag = true;
stack<int> stk;
for (int i = 0; i < n; i ++ )
{
int x;
cin >> x;
if(x==cnt) cnt ++;
else
stk.push(x);
if(stk.size()>m) flag =false;
while(1)
{
if(!stk.empty()&&stk.top()==cnt)
{
stk.pop();
cnt ++;
}
else
break;
}
}
if(flag&&stk.empty()) cout << "YES"<<endl;
else
cout <<"NO"<<endl;
}
return 0;
}
2-9 彩虹瓶
最新推荐文章于 2024-09-02 23:09:18 发布