From fca06df52db7f5dc6cb0e845165210c9684a5da0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=EA=B0=95=EC=8B=A0=EC=A7=80?=
 <101992179+ksinji@users.noreply.github.com>
Date: Wed, 26 Nov 2025 15:26:18 +0900
Subject: [PATCH] =?UTF-8?q?[20251126]=20BOJ=20/=20G5=20/=20=EB=82=B4?=
 =?UTF-8?q?=EB=A0=A4=EA=B0=80=EA=B8=B0=20/=20=EA=B0=95=EC=8B=A0=EC=A7=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...64\353\240\244\352\260\200\352\270\260.md" | 54 +++++++++++++++++++
 1 file changed, 54 insertions(+)
 create mode 100644 "ksinji/202511/26 BOJ \353\202\264\353\240\244\352\260\200\352\270\260.md"

diff --git "a/ksinji/202511/26 BOJ \353\202\264\353\240\244\352\260\200\352\270\260.md" "b/ksinji/202511/26 BOJ \353\202\264\353\240\244\352\260\200\352\270\260.md"
new file mode 100644
index 00000000..eb485dcd
--- /dev/null
+++ "b/ksinji/202511/26 BOJ \353\202\264\353\240\244\352\260\200\352\270\260.md"	
@@ -0,0 +1,54 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        
+        int n = Integer.parseInt(br.readLine());
+        int[][] map = new int[n][3];
+        int[] maxdp = new int[3];
+        int[] mindp = new int[3];
+
+        for (int i=0; i<n; i++){
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            for (int j=0; j<3; j++){
+                int num = Integer.parseInt(st.nextToken());
+                if (i==0) {
+                    maxdp[j] = num;
+                    mindp[j] = num;
+                }
+                map[i][j] = num;
+            }
+        }
+
+        for (int i=1; i<n; i++){
+            int max1 = Math.max(maxdp[0], maxdp[1]);
+            int max2 = Math.max(maxdp[1], maxdp[2]);
+            maxdp[0] = max1 + map[i][0];
+            maxdp[2] = max2 + map[i][2];
+
+            int max3 = Math.max(max1, max2);
+            maxdp[1] = max3 + map[i][1];
+
+            int min1 = Math.min(mindp[0], mindp[1]);
+            int min2 = Math.min(mindp[1], mindp[2]);
+            mindp[0] = min1 + map[i][0];
+            mindp[2] = min2 + map[i][2];
+
+            int min3 = Math.min(min1, min2);
+            mindp[1] = min3 + map[i][1];
+        }
+
+        int min = Integer.MAX_VALUE;
+        int max = 0;
+        for (int i=0; i<3; i++){
+            min = Math.min(min, mindp[i]);
+            max = Math.max(max, maxdp[i]);
+        }
+
+        System.out.print(max+" "+min);
+    }
+}
+```