Notice
Recent Posts
Recent Comments
Link
목록11048 (1)
clohi 님의 블로그
[BOJ / Python] 11048 : 이동하기
https://www.acmicpc.net/problem/11048 문제 코드import sysinput = sys.stdin.readlinen, m = map(int, input().split())dp = [[0 for _ in range(m+1)] for _ in range(n+1)]maze = []for i in range(n): maze.append(list(map(int, input().split())))for j in range(1, n+1): for k in range(1, m+1): dp[j][k] = max(dp[j-1][k-1], dp[j-1][k], dp[j][k-1]) + maze[j-1][k-1]print(dp[n][m]) 문제 풀이 - dp dp로 어렵지..
Algorithm/BOJ
2025. 8. 3. 23:35