1012 유기농 배추 #include using namespace std; const int MAX = 51; int test_case, m,n,k; int board[MAX][MAX]; int visited[MAX][MAX]; int dy[] = { 0,0,-1,1 }; int dx[] = { -1,1,0,0 }; void DFS(int y, int x) { visited[y][x] = 1; for (int i = 0; i = m || ny = n) continue; if (board[ny][nx] == 1 && visited[ny][nx] == 0) { DF..
