1. 가장 높은 봉우리에서 탐색 2. k만큼 땅을 팠다가 복구 def dfs(x, y, cnt): global answer answer = max(answer, cnt) for i in range(4): nx, ny = x + dx[i], y + dy[i] if 0 = k: mountain[i][j] -= k new_start(candidates) mountain[i][j] += k for test in range(1, int(input()) + 1): N, K = map(int, input().split()) mountain = [list(map(int, input().split())) for _ in range(N)] visited = [[False] * N for _ in range(N)] answ..