[백준] BOJ 1937번 욕심쟁이 판다

www.acmicpc.net/problem/1937

1937번: 욕심쟁이 판다

from sys import setrecursionlimit
setrecursionlimit(10**9)

dx = [0, 0, -1, 1]
dy = [-1, 1, 0, 0]
dp = [[0]*501 for _ in range(501)]
N = int(input())
bamboo = []
result = 0

def dfs(i, j):
  if dp[i][j]: return dp[i][j]

  dp[i][j] = 1
  
  for k in range(4):
    if i+dx[k] == -1 or i+dx[k] == N or j+dy[k] == -1 or j+dy[k] == N: 
      continue
    
    if bamboo[i][j] < bamboo[i+dx[k]][j+dy[k]]:
      dp[i][j] = max(dp[i][j], dfs(i+dx[k], j+dy[k])+1)

  return dp[i][j]


bamboo = [list(map(int, input().split())) for _ in range(N)]

for i in range(N):
  for j in range(N):
    result = max(result, dfs(i, j))

print(result)