BEAKJOON JAVA ALGORITHM #11048(이동하기)

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

import java.util.Scanner; public class a11048 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int b = sc.nextInt(); int[][] arr = new int[a+1][b+1]; for(int i=1; i<=a; i++) { for(int j=1; j<=b; j++) { arr[i][j] = sc.nextInt(); } } //d[i][j]를기준으로 구할때 /*int[][] d = new int[a+1][b+1]; for(int i=1; i<=a; i++) { for(int j=1; j<=b; j++) { d[i][j] = Math.max(d[i-1][j], Math.max(d[i][j-1], d[i-1][j-1])) + arr[i][j]; } }*/ //d[i][j]가 이동하는 곳을 기준으로 할때 int[][] d = new int[a+1][b+1]; d[1][1] = arr[1][1]; for(int i=1; i<=a; i++) { for(int j=1; j<=b; j++) { if(j+1 <= b && d[i][j+1] < d[i][j] + arr[i][j+1]) { d[i][j+1] = d[i][j] + arr[i][j+1]; } if(i+1 <= a && d[i+1][j] < d[i][j] + arr[i+1][j]) { d[i+1][j] = d[i][j] + arr[i+1][j]; } if(i+1 <= a && j+1 <= b && d[i+1][j+1] < d[i][j] + arr[i+1][j+1]) { d[i+1][j+1] = d[i][j] + arr[i+1][j+1]; } } } System.out.println(d[a][b]); } }