Skip to content

Commit da7e7b4

Browse files
authored
[20251005] BOJ / G5 / 내려가기 / 이준희
1 parent 84c23c2 commit da7e7b4

File tree

1 file changed

+45
-0
lines changed

1 file changed

+45
-0
lines changed
Lines changed: 45 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,45 @@
1+
```java
2+
import java.io.*;
3+
import java.util.*;
4+
5+
public class Main {
6+
7+
public static void main(String[] args) throws IOException {
8+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
9+
StringTokenizer st;
10+
11+
int n = Integer.parseInt(br.readLine());
12+
13+
int[][] map = new int[n][3];
14+
int[][] dpmax = new int[n][3];
15+
int[][] dpmin = new int[n][3];
16+
17+
for (int i = 0; i < n; i++) {
18+
st = new StringTokenizer(br.readLine());
19+
for (int j = 0; j < 3; j++) {
20+
map[i][j] = Integer.parseInt(st.nextToken());
21+
if (i == 0) {
22+
dpmax[i][j] = dpmin[i][j] = map[i][j];
23+
}
24+
}
25+
}
26+
27+
for (int i = 1; i < n; i++) {
28+
for (int j = 0; j < 3; j++) {
29+
if (j == 0) {
30+
dpmax[i][j] = Math.max(dpmax[i - 1][j], dpmax[i - 1][j + 1]) + map[i][j];
31+
dpmin[i][j] = Math.min(dpmin[i - 1][j], dpmin[i - 1][j + 1]) + map[i][j];
32+
} else if (j == 1) {
33+
dpmax[i][j] = Math.max(Math.max(dpmax[i - 1][j], dpmax[i - 1][j + 1]), dpmax[i - 1][j - 1]) + map[i][j];
34+
dpmin[i][j] = Math.min(Math.min(dpmin[i - 1][j], dpmin[i - 1][j + 1]), dpmin[i - 1][j - 1]) + map[i][j];
35+
} else {
36+
dpmax[i][j] = Math.max(dpmax[i - 1][j], dpmax[i - 1][j - 1]) + map[i][j];
37+
dpmin[i][j] = Math.min(dpmin[i - 1][j], dpmin[i - 1][j - 1]) + map[i][j];
38+
}
39+
}
40+
}
41+
42+
System.out.println(Math.max(Math.max(dpmax[n - 1][0], dpmax[n - 1][1]), dpmax[n - 1][2]) + " " + Math.min(Math.min(dpmin[n - 1][0], dpmin[n - 1][1]), dpmin[n - 1][2]));
43+
}
44+
}
45+
```

0 commit comments

Comments
 (0)