Submission

Score: 100

User: angpangSK

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

Language: cpp

Time: 0.004 second

Submitted On: 2025-11-17 15:32:00

#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] = 1;
    cnt++;
    for (int i = 0; i < 4; i++) {
        int nx = a + walkx[i];
        int ny = b + walky[i];
        if (nx >= 0 && ny >= 0 && nx < n && ny < m && v[nx][ny] == 1 && !visitt[nx][ny]) {
            findmax(nx,ny);
        }
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    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;
}