[백준 1981번] 배열에서의 이동 (Python3)
from collections import * dy = [1,-1,0,0]; dx = [0,0,1,-1] def BFS(): dq = deque([(0,0,board[0][0],board[0][0])]) while dq: y,x,m,M = dq.popleft() if DP[y][x][m]=0 and N>x1>=0: dq.append((y1,x1,min(m,board[y1][x1]),max(M,board[y1][x1]))) N = int(input()) board = [[*map(int,input().split())] for i in range(N)] DP = [[[400]*201 for i in range(N)] for i in range(N)] BFS() print(min(DP[-1][-1][i]-i ..