1861. 정사각형 방

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5LtJYKDzsDFAXc&categoryId=AV5LtJYKDzsDFAXc&categoryType=CODE&problemTitle=%EC%A0%95%EC%82%AC%EA%B0%81%ED%98%95&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1 

SW Expert Academy

T = int(input())
for tc in range(1,T+1):
    n = int(input())
    arr = [list(map(int,input().split())) for _ in range(n)]
    mx_cnt = 0
    mx_start = 0
    for k in range(n):
        for h in range(n):
            cnt = 1
            i, j = k,h
            start = arr[i][j]
            while True:
                for di, dj in [[0,1],[1,0],[0,-1],[-1,0]]:
                    ni, nj = i+di, j+dj
                    if 0<=ni<n and 0<=nj<n and arr[i][j]+1 == arr[ni][nj]:
                        cnt += 1
                        i, j = ni, nj
                        break
                else:
                    break
            if mx_cnt < cnt:
                mx_cnt = cnt
                mx_start = start
            elif mx_cnt == cnt and mx_start > start:
                mx_start = start
    print(f'#{tc} {mx_start} {mx_cnt}')

실행시간 확 줄인 다른 풀이

didj = [[0,1],[1,0],[0,-1],[-1,0]]
T = int(input())
for tc in range(1, T+1):
    N = int(input())
    arr = [list(map(int, input().split())) for _ in range(N)]
 
    ones = [0] * (N*N+1) # 연속으로 1이 커지는 경우를 표시할 배열
    for i in range(N):
        for j in range(N):
            for di, dj in didj:
                ni, nj = i+di, j+dj # arr[i][j]의 주변 칸이
                if 0<=ni<N and 0<=nj<N and arr[i][j]+1==arr[ni][nj]:
                    ones[arr[i][j]] = 1
    max_cnt = 0
    max_start = 0
    c = 0
    for k in range(N*N,0,-1):
        if ones[k]:
            c += 1
            if max_cnt<c:
                max_cnt = c
                max_start = k
            elif max_cnt==c:
                max_start = k
        else:   # ones[k]가 0이면
            c = 0
    print(f'#{tc} {max_start} {max_cnt+1}')