Pagini recente » Cod sursa (job #2124666) | Cod sursa (job #1298447) | Cod sursa (job #434051) | Cod sursa (job #3005196) | Cod sursa (job #2428052)
#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];
}