백준 알고리즘[DP] - 이동하기

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

 

import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
 
import java.io.FileInputStream;
import java.io.FileNotFoundException;
 
class Main {
    public static int n,m,max;
    public static int[][] maps;
    
 
    public static void main(String args[]) throws FileNotFoundException{
        FileInputStream fi = new FileInputStream("C:\\Users\\Desktop\\JavaTools\\Tools\\workspace\\Solution\\src\\input.txt");
        Scanner sc = new Scanner(fi);
        //Scanner sc = new  Scanner(System.in);
        
        n = sc.nextInt();
        m = sc.nextInt();
        maps = new int[n+1][m+1];
        
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                maps[i][j] = sc.nextInt();
            }
        }
        
        for(int x=1;x<=n;x++)
            maps[x][1] += maps[x-1][1];
        for(int y=1;y<=m;y++)
            maps[1][y] += maps[1][y-1];
        
        for(int i=2;i<=n;i++){
            for(int j=2;j<=m;j++){
                if(maps[i-1][j-1]>maps[i-1][j] && maps[i-1][j-1]>maps[i][j-1]) // i-1, j-1이 제일 클 때
                    maps[i][j] += maps[i-1][j-1];
                else if(maps[i-1][j]>maps[i-1][j-1] && maps[i-1][j]>maps[i][j-1]) // i-1, j이 제일 클 때
                    maps[i][j] += maps[i-1][j];
                else // i-1, j-1이 제일 클 때
                    maps[i][j] += maps[i][j-1];
            }
        }
        
        System.out.println(maps[n][m]);
    
    }
 
 
}