Submission

Score: 100

User: 12345678

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-11-22 20:33:00

#include <bits/stdc++.h>

using namespace std;

const int nx=205;

int n, m, vs[nx][nx], cnt, mx, di[]={1, 0, 0, -1}, dj[]={0, 1, -1, 0};
char mp[nx][nx];
queue<pair<int, int>> q;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=n; i++) for (int j=1; j<=m; j++) cin>>mp[i][j];
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=m; j++)
        {
            if (mp[i][j]=='0'||vs[i][j]) continue;
            q.push({i, j});
            vs[i][j]=1;
            cnt=0;
            while (!q.empty())
            {
                auto [ci, cj]=q.front();
                q.pop();
                cnt++;
                for (int k=0; k<4; k++)
                {
                    int ni=ci+di[k], nj=cj+dj[k];
                    if (mp[ni][nj]=='1'&&!vs[ni][nj]) vs[ni][nj]=1, q.push({ni, nj});
                }
            }
            mx=max(mx, cnt);
        }
    }
    cout<<mx;
}