https://www.acmicpc.net/problem/2468 코드#include #include using namespace std;#define MAX 101int arr[MAX][MAX], ans = 0, dx[4] = { 1, -1, 0, 0 }, dy[4] = { 0, 0, 1, -1 }, n;bool visit[MAX][MAX];void bfs(int x, int y, int h) { visit[x][y] = true; queue> q; q.push({ x, y }); while (!q.empty()) { int nx = q.front().first; int ny = q.front().second; q.pop(); for (int i = 0; i = 0 && gx = 0 && gy ..
