BEAKJOON JAVA ALGORITHM #1932(숫자삼각형)

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

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; import java.util.StringTokenizer; public class a1932 { public static void main(String[] args) throws IOException { BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); int num=Integer.parseInt(br.readLine()); int arr[][] = new int[num][num]; int sum[][] = new int[num][num]; for(int i=0;i<num;i++){ StringTokenizer token = new StringTokenizer(br.readLine()); for(int j=0;j<=i;j++){ arr[i][j]=Integer.parseInt(token.nextToken()); } } sum[0][0] = arr[0][0]; for(int i=1;i<num;i++){ for(int j=0; j<i+1;j++){ if(i==0 && j==0){ sum[i][j] = arr[i][j]; }else if(j==0){ sum[i][j] = sum[i-1][j]+arr[i][j]; }else if(i==j){ sum[i][j] = sum[i-1][j-1] + arr[i][j]; }else{ sum[i][j] = Math.max(sum[i-1][j-1], sum[i-1][j]) + arr[i][j]; } } } int[] result = sum[num-1]; Arrays.sort(result); System.out.println(result[num-1]); } }