From 3ef50478dca3b75dd5c153470c6b9f434e282009 Mon Sep 17 00:00:00 2001
From: llIllIllIllIllIllIllIllI <_@seol.pro>
Date: Sun, 7 Dec 2025 23:52:38 +0900
Subject: [PATCH] =?UTF-8?q?[20251207]=20BOJ=20/=20G5=20/=20=EB=B2=BD?=
 =?UTF-8?q?=EC=9E=A5=EB=AC=B8=EC=9D=98=20=EC=9D=B4=EB=8F=99=20/=20?=
 =?UTF-8?q?=EC=84=A4=EC=A7=84=EC=98=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...0\354\235\230 \354\235\264\353\217\231.md" | 43 +++++++++++++++++++
 1 file changed, 43 insertions(+)
 create mode 100644 "Seol-JY/202512/07 BOJ G5 \353\262\275\354\236\245\353\254\270\354\235\230 \354\235\264\353\217\231.md"

diff --git "a/Seol-JY/202512/07 BOJ G5 \353\262\275\354\236\245\353\254\270\354\235\230 \354\235\264\353\217\231.md" "b/Seol-JY/202512/07 BOJ G5 \353\262\275\354\236\245\353\254\270\354\235\230 \354\235\264\353\217\231.md"
new file mode 100644
index 00000000..edbf1682
--- /dev/null
+++ "b/Seol-JY/202512/07 BOJ G5 \353\262\275\354\236\245\353\254\270\354\235\230 \354\235\264\353\217\231.md"	
@@ -0,0 +1,43 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    static int n, m;
+    static int[] order;
+    static int[][][] dp;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        n = Integer.parseInt(br.readLine().trim());
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        int open1 = Integer.parseInt(st.nextToken());
+        int open2 = Integer.parseInt(st.nextToken());
+        m = Integer.parseInt(br.readLine().trim());
+        order = new int[m];
+        for (int i = 0; i < m; i++) {
+            order[i] = Integer.parseInt(br.readLine().trim());
+        }
+
+        dp = new int[m + 1][n + 1][n + 1];
+        for (int[][] arr2d : dp) {
+            for (int[] arr1d : arr2d) {
+                Arrays.fill(arr1d, -1);
+            }
+        }
+
+        System.out.println(solve(0, open1, open2));
+    }
+
+    static int solve(int idx, int a, int b) {
+        if (idx == m) return 0;
+        if (dp[idx][a][b] != -1) return dp[idx][a][b];
+
+        int target = order[idx];
+        int moveA = Math.abs(target - a) + solve(idx + 1, target, b);
+        int moveB = Math.abs(target - b) + solve(idx + 1, a, target);
+
+        return dp[idx][a][b] = Math.min(moveA, moveB);
+    }
+}
+```