Repository navigation
Expand file tree
/
Copy pathBOJ_1932.java
More file actions
81 lines (62 loc) · 2.24 KB
/
Copy pathBOJ_1932.java
File metadata and controls
81 lines (62 loc) · 2.24 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
package baekjoon.silver;
import java.io.*;
import java.util.StringTokenizer;
public class BOJ_1932 {
static int N;
static int[][] arr;
static int[][] sum;
static boolean[][] visited;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringTokenizer st;
N = Integer.parseInt(br.readLine());
arr = new int[N][];
sum = new int[N][];
visited = new boolean[N][];
for (int i = 0; i < N; i++) {
arr[i] = new int[i + 1];
sum[i] = new int[i + 1];
visited[i] = new boolean[i + 1];
st = new StringTokenizer(br.readLine());
for (int j = 0; j < arr[i].length; j++) {
arr[i][j] = Integer.parseInt(st.nextToken());
}
}
bw.write(dp() + "");
bw.flush();
bw.close();
}
private static int dp() { // 왼쪽 : 인덱스 동일, 오른쪽 : 인덱스 + 1
sum[0][0] = arr[0][0];
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr[i].length; j++) {
// 왼쪽값 넣기
int value = sum[i][j] + arr[i + 1][j];
if (visited[i + 1][j]) { // 첫방문 X
if (sum[i + 1][j] < value)
sum[i + 1][j] = value;
} else { // 첫방문 O
visited[i + 1][j] = true;
sum[i + 1][j] = value;
}
// 오른쪽값 넣기
value = sum[i][j] + arr[i + 1][j + 1];
if (visited[i + 1][j + 1]) { // 첫방문 X
if (arr[i + 1][j + 1] < value)
sum[i + 1][j + 1] = value;
} else { // 첫방문 O
visited[i + 1][j + 1] = true;
sum[i + 1][j + 1] = value;
}
}
}
// 최댓값 찾기
int max = Integer.MIN_VALUE;
for (int i = 0; i < N; i++) {
if (max < sum[N - 1][i])
max = sum[N - 1][i];
}
return max;
}
}