Pagini recente » Cod sursa (job #2844328) | Cod sursa (job #2839907) | Cod sursa (job #982777) | Cod sursa (job #219259) | Cod sursa (job #2493268)
#include <cstdio>
#include <algorithm>
#include <climits>
#define MAXIM LLONG_MAX
using namespace std;
int n;
long long dp[505][505], d[505];
int main()
{
freopen("podm.in", "r", stdin);
freopen("podm.out", "w", stdout);
scanf("%d", &n);
for(int i=0; i<=n; i++)
{
scanf("%lld", &d[i]);
}
for(int dif=1; dif<n; dif++)
{
for(int i=1; i<=n; i++)
{
long long vmin=MAXIM;
int j=i+dif;
for(int k=i; k<=j-1; k++)
{
vmin=min(vmin, dp[i][k]+dp[k+1][j]+d[i-1]*d[k]*d[j]);
}
dp[i][j]=vmin;
}
}
printf("%lld", dp[1][n]);
return 0;
}