🐜 STUDY: 최적의 행렬 곱셈

Author: ing-eoking

ing-eoking/최적의 행렬 곱셈.cc

@@ -0,0 +1,26 @@
+#include <string>
+#include <vector>
+#include <iostream>
+#include <climits>
+#include <algorithm>
+
+using namespace std;
+
+int solution(vector<vector<int>> matrix_sizes) {
+    const int N = matrix_sizes.size();
+    vector<vector<long long>> m(N, vector<long long>(N,0));
+    for (int i = 1; i < N; i++) {
+        for (int j = 0; j < N - i; j++) {
+            int a = j, b = j + i;
+            m[a][b] = LLONG_MAX;
+            for (int k = a; k < b; k++) {
+                m[a][b] = min(m[a][b], 
+                              m[a][k] + m[k+1][b] + 
+                              (matrix_sizes[a][0] * matrix_sizes[k][1] * matrix_sizes[b][1]));
+            }
+            
+        }
+    }
+
+    return m[0][N-1];
+}