1a:I[83391,["/_next/static/chunks/01ctw1akxhipf.js","/_next/static/chunks/0es-u.8d.mnrl.js","/_next/static/chunks/0dy1a2.mvnkkn.js","/_next/static/chunks/1490m.ueos6wm.js","/_next/static/chunks/0e0r8s6q6rqo3.js","/_next/static/chunks/06ql-volcxfrm.js"],"ProblemWorkspace",1] 1d:I[27201,["/_next/static/chunks/01xlw8hd842-c.js","/_next/static/chunks/0-mla.nmfqw.d.js"],"IconMark"] 1b:T438,#include using namespace std; int main() { int R, C; cin >> R >> C; vector g(R); for (auto& row : g) cin >> row; vector> viz(R, vector(C, false)); int dr[4] = {-1, 1, 0, 0}, dc[4] = {0, 0, -1, 1}; int best = 0; for (int i = 0; i < R; i++) for (int j = 0; j < C; j++) { if (g[i][j] == '1' && !viz[i][j]) { int size = 0; vector> stack; stack.push_back({i, j}); viz[i][j] = true; while (!stack.empty()) { auto [cr, cc] = stack.back(); stack.pop_back(); size++; for (int d = 0; d < 4; d++) { int nr = cr + dr[d], nc = cc + dc[d]; if (nr >= 0 && nr < R && nc >= 0 && nc < C && g[nr][nc] == '1' && !viz[nr][nc]) { viz[nr][nc] = true; stack.push_back({nr, nc}); } } } best = max(best, size); } } cout << best << "\n"; return 0; } 1c:T438,#include using namespace std; int main() { int R, C; cin >> R >> C; vector g(R); for (auto& row : g) cin >> row; vector> viz(R, vector(C, false)); int dr[4] = {-1, 1, 0, 0}, dc[4] = {0, 0, -1, 1}; int best = 0; for (int i = 0; i < R; i++) for (int j = 0; j < C; j++) { if (g[i][j] == '1' && !viz[i][j]) { int size = 0; vector> stack; stack.push_back({i, j}); viz[i][j] = true; while (!stack.empty()) { auto [cr, cc] = stack.back(); stack.pop_back(); size++; for (int d = 0; d < 4; d++) { int nr = cr + dr[d], nc = cc + dc[d]; if (nr >= 0 && nr < R && nc >= 0 && nc < C && g[nr][nc] == '1' && !viz[nr][nc]) { viz[nr][nc] = true; stack.push_back({nr, nc}); } } } best = max(best, size); } } cout << best << "\n"; return 0; }