From 049a74b2e8fb1576d289e1dc9dd8be003a3b4a27 Mon Sep 17 00:00:00 2001
From: kimhojun <63347089+esc10946@users.noreply.github.com>
Date: Wed, 28 Jan 2026 08:58:31 +0900
Subject: [PATCH] =?UTF-8?q?260128=20:=20[BOJ=2011049]=20=ED=96=89=EB=A0=AC?=
 =?UTF-8?q?=20=EA=B3=B1=EC=85=88=20=EC=88=9C=EC=84=9C?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 _hojun/11049.cpp | 30 ++++++++++++++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 _hojun/11049.cpp

diff --git a/_hojun/11049.cpp b/_hojun/11049.cpp
new file mode 100644
index 00000000..e898a614
--- /dev/null
+++ b/_hojun/11049.cpp
@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+#define endl "\n"
+
+using namespace std;
+
+int dp[501][501];
+int matrix[501][2];
+
+int main() {
+    ios::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    int N; cin >> N;
+    for (int i = 1; i <= N; ++i) {
+        cin >> matrix[i][0] >> matrix[i][1];
+    }
+
+    for (int i = 1; i <= N; ++i) {
+        for (int j = 1; i + j <= N; ++j) {
+            dp[j][i + j] = INT_MAX;
+            for (int k = j; k < i + j; k++)
+            {
+                dp[j][i + j] = min(dp[j][i + j], dp[j][k] + dp[k + 1][i + j] + matrix[j][0] * matrix[k][1] * matrix[i + j][1]);
+            }
+        }
+    }
+
+    cout << dp[1][N];
+    return 0;
+}
\ No newline at end of file