[백준/C++] 2234 성곽
https://www.acmicpc.net/problem/2234코드#include #include #include using namespace std;#define MAX 51#define FASTIO ios::sync_with_stdio(false);cin.tie(NULL);typedef pair pi;int n, m, arr[MAX][MAX], roomCnt, maxRoomSize;int dx[4] = { 0, -1, 0, 1 }, dy[4] = { -1, 0, 1, 0 };bool visit[MAX][MAX];void bfs(int x, int y) { int roomSize = 0; queue q; q.push({ x, y }); visit[x][y] = true; w..
