#include <iostream>
using namespace std;
#include <vector>
int dir[4][2] = { 0,1,1,0,-1,0,0,-1 };
void dfs(vector<vector<int>>& grid, vector<vector<bool>>& visited, int x, int y, int& area)
{
if (visited[x][y] == true || grid[x][y] == 0) return;
visited[x][y] = true;
area++;
for (int i = 0; i < 4; i++)
{
int nextx = x + dir[i][0];
int nexty = y + dir[i][1];
if (nextx < 0 || nextx >= grid.size() || nexty < 0 || nexty >= grid[0].size()) continue;
dfs(grid, visited, nextx, nexty, area);
}
}
int main()
{
int n, m;
cin >> n >> m;
vector<vector<int>> grid(n, vector<int>(m, 0));
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
cin >> grid[i][j];
}
}
vector<vector<bool>> visited(n, vector<bool>(m, false));
int result = 0;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (visited[i][j] == false && grid[i][j] == 1)
{
int area = 0;
dfs(grid, visited, i, j, area);
result = max(result, area);
}
}
}
cout << result << endl;
system("pause");
return 0;
}
01-19
08-03
1135
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
08-06
45
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)