[백준 문제풀이] 얼렁뚱땅 2589 보물섬 풀이

https://www.acmicpc.net/problem/2589

2589번: 보물섬

 

from collections import deque

n, m = map(int,input().split())
arr = [list(map(str,input())) for _ in range(n)]

dx = [0, 0, 1, -1]
dy = [1, -1, 0, 0]

def bfs(x,y,c) :

    global max_

    q = deque()
    q.append([x,y,c])
    visited[x][y] = 1
    
    while q :
        x_,y_,count_= q.popleft()

        if count_ > max_ :
            max_ = count_

        for i in range(4) :
            nx = x_ + dx[i]
            ny = y_ + dy[i]

            if 0<=nx<n and 0<=ny<m :
                if arr[nx][ny] == 'L' and visited[nx][ny] == 0:
                    visited[nx][ny] = 1
                    q.append([nx,ny,count_+1])




max_ = -1
for i in range(n) :
    for j in range(m) :
        if arr[i][j]=='L':
            visited = [[0]*m for _ in range(n)]
            bfs(i,j,0)


print(max_)