Cod sursa(job #2696095)
Utilizator | Luca Mazilescu lucam | Data | 15 ianuarie 2021 12:28:15 |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
constexpr int N = 500;
int a[N + 1];
long long dp[N][N];
int main() {
std::ifstream in("podm.in");
std::ofstream out("podm.out");
int n;
in >> n;
for (int *p = a; p != a + n + 1; ++p)
in >> *p;
for (int i = n - 1; i >= 0; --i)
for (int j = i; j < n; ++j) {
if (i == j)
continue;
dp[i][j] = 1ll << 62;
for (int k = i; k < j; ++k)
dp[i][j] = std::min(dp[i][j], dp[i][k] + dp[k + 1][j] + static_cast<long long>(a[i]) * a[k + 1] * a[j + 1]);
}
out << dp[0][n - 1] << '\n';
}