DP로 풀이하였는데 테케 12번에 대하여 반례가 궁금합니다
import sys
n = int(input())
field = [list(map(int, input().split())) for _ in range(n)]
dp = [[[0, 0] for _ in range(n)] for _ in range(n)]
dp[0][0] = [field[0][0]*2, field[0][0]]
for i in range(n):
for j in range(n):
candits = []
for dx, dy in [(-1, 0), (0, -1)]:
bx, by = i+dx, j+dy
if bx < 0 or bx >= n or by < 0 or by >= n:
continue
if dp[bx][by][1] < field[i][j]:
tsum_value, tma...
- 연습문제 톡
- 날짜
- 2024-06-28 11:26:42
- 작성자
- qhdrmfdl123
- 댓글
- 0