[Algorithm] Baekjoon 1926번 : 그림

https://www.acmicpc.net/problem/1926

1926번: 그림

struct Node
{
    int y;
    int x;
};
 
int row, col;
int arr[501][501];
int dir[4][2] = { {-1,0}, {1,0}, {0,-1}, {0,1} };
 
 
int getArea(int startY, int startX)
{
    queue<Node> q;
    q.push({ startY,startX });
    arr[startY][startX] = 0;
    int count = 1;
    
 
    while (!q.empty())
    {
        int curY = q.front().y;
        int curX = q.front().x;
        q.pop();
 
        for (int i = 0; i < 4; ++i)
        {
            int nextY = curY + dir[i][0];
            int nextX = curX + dir[i][1];
 
            if (nextY < 0 || nextY >= row) continue;
            if (nextX < 0 || nextX >= col) continue;
            if (!arr[nextY][nextX]) continue;
 
            ++count;
            arr[nextY][nextX] = 0;
            q.push({ nextY,nextX });
        }
    }
 
    return count;
}
 
 
 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
 
    int maxArea = 0;
    int count = 0;
 
    cin >> row >> col;
 
    for (int i = 0; i < row; ++i)
    {
        for (int j = 0; j < col; ++j)
        {
            cin >> arr[i][j];
        }
    }
 
    for (int i = 0; i < row; ++i)
    {
        for (int j = 0; j < col; ++j)
        {
            if (arr[i][j] == 0) continue;
            ++count;
            maxArea = max(maxArea, getArea(i, j));
        }
    }
 
 
    cout << count << endl << maxArea;
}