1051. Pop Sequence (25)

# include <cstdio>
# include <cstring>
# include <stack>
using namespace std;
stack<int> s;
int main()
{
int n,m,k,ans[1010];
while(scanf("%d%d%d",&m,&n,&k)==3)
{
//memset(ans,0,sizeof(ans));
int i,num,size;
while(k--)
{
while(!s.empty()) s.pop();
num = 1;
for(i = 0;i < n;i++)
scanf("%d",&ans[i]);
s.push(num++);
size = 0;
bool flag = false;
while(size < n)
{
int kk = s.top();
if(s.size() > m)
{
flag = true;
break;
}
if(kk == ans[size])
{
s.pop();
size++;
}
else if(kk < ans[size])
s.push(num++);
else
{
flag = true;
break;
}
if(s.empty()) s.push(num++);
}
if(flag) printf("NO\n");
else printf("YES\n");
}
}
return 0;
}