Submission

Score: 100

User: KantaponZ

Problemset: เกาะที่ใหญ่ที่สุด

Language: cpp

Time: 0.005 second

Submitted On: 2026-03-10 14:26:11

#include <bits/stdc++.h>
using namespace std;

int n, m;
bool vis[175][175];
int ans = 0;
int xx[4] = {-1, 0, 1, 0};
int yy[4] = {0, -1, 0, 1};
int ct;
queue<tuple<int,int,int>> q;
char grid[175][175];

void dfs(int w, int y, int x) {
    //cout << w << " " << y << " " << x << endl;
    vis[y][x] = 1;
    ct++;
    ans = max(ans, ct);
    for (int i = 0; i < 4; i++) {
        int ny = y + yy[i], nx = x + xx[i];
        if (ny < 1 || ny > n || nx < 1 || nx > m) continue;
        if (vis[ny][nx]) continue;
        dfs(w + 1, ny, nx);
    }
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            char c; cin >> c;
            if (c == '0') vis[i][j] = 1;
            grid[i][j] = c;
        }
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (vis[i][j]) continue;
            ct = 0;
            dfs(1, i, j);
            //cout << "\n-----\n";
        }
    }

    cout << ans;
}