백준 1926 - 그림

1234567891011121314151617181920212223242526272829303132333435363738import sysfrom collections import deque def bfs(i,j): global max_val dimension = 1 q = deque() q.append([j,i]) while q: x,y = q.popleft() for dx,dy in (0,1),(0,-1),(1,0),(-1,0): nx,ny = x+dx, y+dy if 0 <= nx < m and 0 <= ny < n: if graph[ny][nx] == 1 and visit[ny][nx] == 0: visit[ny][nx] = 1 q.append([nx,ny]) dimension += 1 if dimension > max_val: max_val = dimension n, m = map(int, sys.stdin.readline().split())graph = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]visit = [[0]*m for _ in range(n..........

원문링크 : 백준 1926 - 그림