Submission

Score: 0

User: Gump2011

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-08 22:12:40

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

int f(int n, int m, vector<string> &mp){
    if(n < 0 || m < 0 || n >= mp.size() || m >= mp[n].size()){
        return 0;
    }
    if(mp[n][m] == '.'){
        return 0;
    }

    mp[n][m] = '.';
    int cnt = 1;

    cnt += f(n+1, m, mp);
    cnt += f(n-1, m, mp);
    cnt += f(n, m+1, mp);
    cnt += f(n, m-1, mp);

    return cnt;
}

int main(){
    int n, m;
    cin >> n >> m;

    vector<string> mp(m);
    for(int i=0;i<m;i++){
        cin >> mp[i];
    }

    int mx = 0;

    for(int i=0;i<m;i++){
        for(int j=0;j<n;j++){
            if(mp[i][j] == '#'){
                int sz = f(i, j, mp);
                mx = max(mx, sz);
            }
        }
    }

    cout << mx;
}