1. BOJ 11048 이동하기 https://www.acmicpc.net/problem/11048 코드 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 N, M = map(int, input().split()) arr = [list(map(int, input().split())) for _ in range(N)] for i in range(N): for j in range(M): if i==0: if j ==0: arr[i][j] = arr[i][j] else: arr[i][j] += arr[i][j-1] else: if j==0: arr[i][j] += arr[i-1][j] else: arr[i][j] += max(arr[i-1][j], arr[i-1][j-1], arr[i][j..