Cod sursa(job #2696138)
| Utilizator | Data | 15 ianuarie 2021 13:51:40 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
#define int long long
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n;
int v[502];
int dp[502][502];
int32_t main()
{
fin >> n;
for(int i = 1; i <= n + 1; i ++)
{
fin >> v[i];
}
for(int i = n - 1; i >= 1; i --)
{
for(int j = i + 1; j <= n; j ++)
{
dp[i][j] = LLONG_MAX;
for(int k = i; k < j; k ++)
{
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j] + 1LL* v[i] * v[k+1] * v[j+1]);
}
}
}
fout << dp[1][n] << '\n';
return 0;
}
