Cod sursa(job #2428052)
| Utilizator | Data | 3 iunie 2019 17:44:54 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
const int N = 505;
long long dp[N][N],d[N];
int main()
{
int n;
in >> n;
for (int i = 0; i<=n; i++)
in >> d[i];
for (int i = 1; i<=n; i++)
dp[i][i+1] = d[i-1]*d[i]*d[i+1];
for (int len = 2; len<=n; len++)
for (int i = 1; i+len<=n; i++)
{
dp[i][i+len] = LLONG_MAX/2;
for (int j = i; j<i+len; j++)
dp[i][i+len] = min(dp[i][i+len],dp[i][j]+dp[j+1][i+len]+d[i-1]*d[j]*d[i+len]);
}
out << dp[1][n];
}
