|
| 1 | +### [baekjoon-1932] ์ ์ ์ผ๊ฐํ |
| 2 | + |
| 3 | + |
| 4 | + |
| 5 | +> ๋๋ฒ๊น
์ฉ ์ฝ๋ |
| 6 | +
|
| 7 | +```java |
| 8 | +import java.io.BufferedReader; |
| 9 | +import java.io.FileInputStream; |
| 10 | +import java.io.InputStreamReader; |
| 11 | +import java.util.Arrays; |
| 12 | +import java.util.StringTokenizer; |
| 13 | + |
| 14 | +public class Main { |
| 15 | + |
| 16 | + static int N; |
| 17 | + static Node[] nums; |
| 18 | + |
| 19 | + public static void main(String[] args) throws Exception { |
| 20 | + System.setIn(new FileInputStream("src/DP/P1932/input.txt")); |
| 21 | + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); |
| 22 | + |
| 23 | + N = Integer.parseInt(br.readLine()); |
| 24 | + |
| 25 | + nums = new Node[N * (N + 1) / 2 + 1]; |
| 26 | + nums[0] = new Node(0, 0); |
| 27 | + |
| 28 | + int count = 1; |
| 29 | + for (int i = 0; i < N; i++) { |
| 30 | + StringTokenizer st = new StringTokenizer(br.readLine()); |
| 31 | + for (int j = 0; j <= i; j++) { |
| 32 | + int value = Integer.parseInt(st.nextToken()); |
| 33 | + if (j == i) { |
| 34 | + nums[count] = new Node(value, nums[count - i - 1].sum + value); |
| 35 | + } else if (j == 0) { |
| 36 | + nums[count] = new Node(value, nums[count - i].sum + value); |
| 37 | + } else { |
| 38 | + int parent_max = Math.max(nums[count - i - 1].sum, nums[count - i].sum); |
| 39 | + nums[count] = new Node(value, parent_max + value); |
| 40 | + } |
| 41 | + count ++; |
| 42 | + } |
| 43 | + } |
| 44 | + System.out.println(Arrays.toString(nums)); |
| 45 | + } |
| 46 | +} |
| 47 | + |
| 48 | +class Node { |
| 49 | + int value; |
| 50 | + int sum; |
| 51 | + |
| 52 | + public Node(int value, int sum) { |
| 53 | + this.value = value; |
| 54 | + this.sum = sum; |
| 55 | + } |
| 56 | + |
| 57 | + @Override |
| 58 | + public String toString() { |
| 59 | + return "Node{" + |
| 60 | + "value=" + value + |
| 61 | + ", sum=" + sum + |
| 62 | + '}'; |
| 63 | + } |
| 64 | +} |
| 65 | + |
| 66 | +``` |
0 commit comments