转载地址:https://blog.csdn.net/qq_16964363/article/details/79153283
题解:DFS求解连通问题,三维数组存储房间四面墙
#include<cstdio>
#include<cstring>
bool cant[60][60][4]={0},vis[60][60]={0};
int row[4]={0,-1,0,1};
int col[4]={-1,0,1,0},cnt=0,Max=0,area,m,n,a;
void dfs(int color,int x,int y){
vis[x][y]=true;
area++;
if(area>Max)Max=area;
for(int i=0;i<4;i++){
int r=x+row[i],c=y+col[i];
if(r>=1&&r<=m&&c>=1&&c<=n&&!vis[r][c]&&!cant[x][y][i]){
dfs(color,r,c);
}
}
}
int main(){
scanf("%d%d",&m,&n);
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++){
scanf("%d",&a);
if(a&1)cant[i][j][0]=1;
if(a&2)cant[i][j][1]=1;
if(a&4)cant[i][j][2]=1;
if(a&8)cant[i][j][3]=1;
}
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)if(!vis[i][j]){
area=0;
dfs(++cnt,i,j);
}
printf("%d\n%d\n",cnt,Max);
return 0;
}