From a8633ba900be8aa915df0557e6e88bb3ca87d392 Mon Sep 17 00:00:00 2001
From: Ukj0ng <90972240+Ukj0ng@users.noreply.github.com>
Date: Tue, 9 Sep 2025 09:49:23 +0900
Subject: [PATCH] =?UTF-8?q?[20250909]=20BOJ=20/=20G3=20/=20=ED=8C=8C?=
 =?UTF-8?q?=EC=9D=BC=20=ED=95=A9=EC=B9=98=EA=B8=B0=20/=20=ED=95=9C?=
 =?UTF-8?q?=EC=A2=85=EC=9A=B1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...4 \355\225\251\354\271\230\352\270\260.md" | 53 +++++++++++++++++++
 1 file changed, 53 insertions(+)
 create mode 100644 "Ukj0ng/202509/9 BOJ G3 \355\214\214\354\235\274 \355\225\251\354\271\230\352\270\260.md"

diff --git "a/Ukj0ng/202509/9 BOJ G3 \355\214\214\354\235\274 \355\225\251\354\271\230\352\270\260.md" "b/Ukj0ng/202509/9 BOJ G3 \355\214\214\354\235\274 \355\225\251\354\271\230\352\270\260.md"
new file mode 100644
index 00000000..bfbbd353
--- /dev/null
+++ "b/Ukj0ng/202509/9 BOJ G3 \355\214\214\354\235\274 \355\225\251\354\271\230\352\270\260.md"	
@@ -0,0 +1,53 @@
+```
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    private static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    private static int[][] dp;
+    private static int[] file, sum;
+    private static int K;
+
+    public static void main(String[] args) throws IOException {
+        int T = Integer.parseInt(br.readLine());
+        while (T-- > 0) {
+            init();
+            DP();
+            bw.write(dp[1][K] + "\n");
+        }
+        bw.flush();
+        bw.close();
+        br.close();
+
+    }
+
+    private static void init() throws IOException {
+        K = Integer.parseInt(br.readLine());
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        file = new int[K+1];
+        sum = new int[K+1];
+        dp = new int[K+1][K+1];
+
+        for (int i = 1; i <= K; i++) {
+            file[i] = Integer.parseInt(st.nextToken());
+            sum[i] = sum[i-1] + file[i];
+        }
+    }
+
+    private static void DP() {
+        for (int i = 2; i <= K; i++) {
+            for (int j = 1; j <= K-i+1; j++) {
+                int k = i+j-1;
+                dp[j][k] = Integer.MAX_VALUE;
+
+                for (int l = j; l < k; l++) {
+                    int cost = dp[j][l] + dp[l+1][k] + sum[k] - sum[j-1];
+                    dp[j][k] = Math.min(cost, dp[j][k]);
+                }
+            }
+        }
+    }
+}
+```