我的做法是检查每个长度下每个点是否符合作为正方形的左上角的要求
一下是代码,输出很容易PE
#include <cstring>
#include <iostream>
#include <cstdio>
using namespace std;
struct unit{
bool right,down;
};
int main(){
unit bot[10][10];
int i,j,n,m,it,jt,k;
char type;
int rnd=0;
while(scanf("%d%d",&n,&m)!=EOF){
rnd++;
for(i=0;i<10;i++){
for(j=0;j<10;j++){
bot[i][j].down=0;
bot[i][j].right=0;
}
}
for(i=0;i<m;i++){
cin>>type>>it>>jt;
if(type=='H'){
bot[it-1][jt-1].right=1;
}else{
bot[jt-1][it-1].down=1;
}
}if(rnd>1){
cout<<"\n**********************************\n\n";
}
cout<<"Problem #"<<rnd<<"\n\n";
int god=0;
for(k=1;k<=n;k++){
int result=0;
for(i=0;i<n-1;i++){
for(j=0;j<n-1;j++){
bool judge=true;
for(it=i;it-i<k;it++){
if(bot[it][j].down==0){judge=0;break;}
}
for(jt=j;jt-j<k;jt++){
if(bot[it][jt].right==0){judge=0;break;}
}
for(jt=j;jt-j<k;jt++){
if(bot[i][jt].right==0){judge=0;break;}
}
for(it=i;it-i<k;it++){
if(bot[it][jt].down==0){judge=0;break;}
}
if(judge){
result++;
}
}
}
if(result){cout<<result<<" square (s) of size "<<k<<endl;god++;}
}
if(god==0){cout<<"No completed squares can be found.\n";}
}
return 0;
}