[백준 1932, Java] 정수 삼각형

문제

 

1932번: 정수 삼각형

check

 

 

코드

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;

public class Main {
    public static int N;
    public static int[][] integerTriagle;
    public static int[][] maxes;
    public static void main(String[] args) throws Exception{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        StringTokenizer st;

        N = Integer.parseInt(br.readLine());
        integerTriagle =new int[N+1][N+1];
        maxes =new int[N+1][N+1];

        for(int i = 1; i<=N; i++){
            st = new StringTokenizer(br.readLine()," ");
            for(int j= 1; j<=i ;j++){
                integerTriagle[i][j] = Integer.parseInt(st.nextToken());
            }
        }

        calculateMax();
        int result = getMax();
        bw.write(String.valueOf(result));
        bw.flush();

        br.close();
        bw.close();


    }

    public static void calculateMax(){
        for(int n = 1; n<=N ; n++){
            if(n==1){
                maxes[n][n] = integerTriagle[n][n];
            }
            else{
                for(int index = 1; index<=n; index++){
                    maxes[n][index]  = Math.max(maxes[n-1][index-1],maxes[n-1][index]) + integerTriagle[n][index];
                }
            }
        }
    }

    public static int getMax(){
        int max = maxes[N][0];
        for(int index = 1; index<=N; index++){
            if(max<maxes[N][index]) max = maxes[N][index];
        }

        return max;
    }
}