基于Monster 组和GPT的调写:
#include <iostream>
#include <vector>
using namespace std;
const int N = 1010;
int n, m;
int g[N][N];
int vis[N][N];
int dx[4] = { 0, 0, 1, -1 };
int dy[4] = { 1, -1, 0, 0 };
// 深度优先搜索
int dfs(int x, int y) {
if (x < 0 || x >= n || y < 0 || y >= m || !g[x][y] || vis[x][y]) return 0;
vis[x][y] = 1;
int res = 1;
for (int i = 0; i < 4; i++) {
int nx = x + dx[i];
int ny = y + dy[i];
res += dfs(nx, ny);
}
return res;
}
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> g[i][j];
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (g[i][j] && !vis[i][j]) {
int area = dfs(i, j);
ans = max(ans, area);
}
}
}
cout << ans << endl;
return 0;
}
