문제

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

소스코드

import sys
sys.stdin = open("input.txt", 'r')
sys.setrecursionlimit(10**6)
input = sys.stdin.readline

if __name__ == "__main__":  
    n = int(input())
    mm = [list(map(int,input().split())) for _ in range(n)]
    dp = [[0] * n for _ in range(n)]
    result = 0
    dx = [1,-1,0,0]
    dy = [0,0,1,-1]

    def dfs(x,y):
        if dp[x][y] : return dp[x][y] #이미 탐색 완료된 값 메모이제이션 값 사용
        dp[x][y] = 1 #탐색 처리 (나 하나 이동)
        for k in range(4):
            xx = x + dx[k]
            yy = y + dy[k]
            if 0<= xx < n and 0<= yy < n and mm[xx][yy] > mm[x][y]:
                dp[x][y] = max(dp[x][y],dfs(xx,yy) + 1)

        return dp[x][y]

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