[백준][Python] 2589 보물섬 기본적인 bfs문제입니다. import sys input = sys.stdin.readline from collections import deque def bfs(i, j): q = deque() q.append([i, j]) max_n = 0 while q: a, b = q.popleft() for k in range(4): x = a + dx[k] y = b + dy[k] if 0 practivceAlgorithm/백준 2021.11.15