Q1932. 정수 삼각형

import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Q1932 { static long[][] array; public static void main(String[] args) throws Exception{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int maxNum = Integer.valueOf(st.nextToken()); array = new long[maxNum+1][maxNum+1]; for (int i = 1; i <= maxNum; i++) { st = new StringTokenizer(br.readLine()); for (int j = 1; j <= i; j++) { array[i][j] = Integer.valueOf(st.nextToken()); } array[i][1] += array[i-1][1]; for (int j = 2; j < i; j++) { array[i][j] += array[i-1][j-1] >= array[i-1][j] ? array[i-1][j-1] : array[i-1][j]; } array[i][i] += array[i-1][i-1]; } long maxValue = array[maxNum][1]; for (int i = 2; i <= maxNum; i++) { if (maxValue < array[maxNum][i]) { maxValue = array[maxNum][i]; } } System.out.println(maxValue); } }