Pagini recente » Cod sursa (job #976374) | Cod sursa (job #1966950) | Cod sursa (job #1374962) | Cod sursa (job #495659) | Cod sursa (job #2696138)
#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;
}