Submission

Score: 100

User: robgornpeunpadpairoundnigumaipadnea

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-11-12 00:02:39

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

int n, m;
vector<vector<int>> v;
bool visitt[171][171];
int cnt, ans;
int walkx[] = {0, -1, 1, 0}, walky[] = {-1, 0, 0, 1};

void findmax(int a, int b){
    visitt[a][b] = true;
    cnt++;
    for(int i = 0; i < 4; i++){
        int cr = a + walkx[i];
        int cc = b + walky[i];
        if(cr >= 0 && cr < n && cc >= 0 && cc < m && !visitt[cr][cc] && v[cr][cc] == 1){
            findmax(cr, cc);
        }
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n >> m;
    v.resize(n, vector<int>(m));

    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            char x;
            cin >> x;
            v[i][j] = x - '0';
        }
    }

    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            if(v[i][j] == 1 && !visitt[i][j]){
                cnt = 0;
                findmax(i, j);
                ans = max(ans, cnt);
            }
        }
    }

    cout << ans;
}