/*
2020/4/20
第二遍
*/
#include <iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
const int maxn = 10;
int N;
int map_matric[maxn][maxn];
int vis[maxn][maxn];
int flag = 0;
int count_area = 0;
int ans = 0;
int X[4] = {0,0,1,-1};
int Y[4] = {1,-1,0,0};
int test(int x,int y)
{
if(x<0 || x>=N || y<0 || y>=N) return 0;
if(map_matric[x][y] == 1) return 0;
if(vis[x][y] == 1) return 0;
for(int i = 0;i<4;i++)
{
int newX = x + X[i];
int newY = y + Y[i];
if(newX<0 || newX>=N || newY<0 || newY >= N)
flag = 1;
}
return 1;
}
void DFS(int x,int y)
{
count_area++;
vis[x][y] = 1;
//没有需要访问的终点,将所有的能够达到的0遍历
for(int i = 0;i<4;i++)
{
int newX = x + X[i];
int newY = y + Y[i];
if(test(newX,newY))
{
DFS(newX,newY);
}
}
}
void DFSTraval()
{
for(int i = 0;i<N;i++)
{
for(int j = 0;j<N;j++)
{
if(map_matric[i][j] == 0 && vis[i][j] == 0)
{
flag = 0;
count_area = 0;
DFS(i,j);
if(flag == 0 && count_area>ans)
ans = count_area;
}
}
}
}
int main()
{
scanf("%d",&N);
for(int i = 0;i<N;i++)
{
for(int j = 0;j<N;j++)
{
scanf("%d",&map_matric[i][j]);
}
}
memset(vis,0,sizeof(vis));
DFSTraval();
printf("%d\n",ans);
return 0;
}
/*
IN:
6
1 1 1 1 1 1
1 1 0 0 0 1
1 0 0 0 1 0
1 1 0 1 1 1
0 1 0 1 0 0
1 1 1 1 1 1
OUT:
8
*/
2012-2
最新推荐文章于 2023-02-22 11:11:26 发布