[백준] 1932 정수 삼각형 (실버 1)

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

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

public class Main {
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        int[][] tri = new int[n+1][n+1];

        for(int i=1;i<=n;i++){
            StringTokenizer st = new StringTokenizer(br.readLine());
            for(int j=1;j<i+1;j++){
                tri[i][j] = Integer.parseInt(st.nextToken());
            }
        }
		// 밑에서부터 진행
    	// 왼 오 중에 합친 거 중에 큰 값 선택
        for(int i=n-1;i>0;i--){
            for(int j=1;j<=i;j++){
                tri[i][j] += Math.max(tri[i+1][j], tri[i+1][j+1]);
            }
        }

        System.out.println(tri[1][1]);
    }
}