题目地址:http://pat.zju.edu.cn/contests/pat-a-practise/1051
解题感悟:个人觉得这道题挺有意思的,拙劣代码如下
代码如下:
#include <iostream>
#include <cstdio>
#include <stack>
using namespace std;
stack<int> s;
int main(){
//freopen("C:\\Users\\Devon\\Desktop\\input.txt","r",stdin);
int m,n,k;
scanf("%d%d%d",&m,&n,&k);
s.push(0);
for(int i=0;i<k;i++){
int yes=1;
int *isPush=new int[n+1];
for(int i=0;i<=n;i++) isPush[i]=0;
while(s.size()>1) s.pop();
for(int j=0;j<n;j++){
int temp;
scanf("%d",&temp);
if(temp>s.top()&&s.size()>1){
int cur=s.top();
s.pop();
isPush[cur]=1;
while(s.size()>1){
int t=s.top();
s.pop();
isPush[t]=1;
for(int k=cur+1;k<=t;k++) if(isPush[k]==0) yes=0;
cur=t;
}
}
s.push(temp);
if(s.size()>m+1) yes=0;
}
if(!yes) printf("NO\n");
else printf("YES\n");
}
return 0;
}