Pagini recente » Cod sursa (job #2901673) | Cod sursa (job #1044082) | Cod sursa (job #2367238) | Cod sursa (job #2386097) | Cod sursa (job #2426015)
#include <bits/stdc++.h>
using namespace std;
int v[510];
long long d[510][510];
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
int n;
scanf("%d",&n);
n++;
for(int i=1; i<=n; i++)
scanf("%d",&v[i]);
for(int l=2; l<n; l++)
for(int i=1; i+l<=n; i++)
{
int j=i+l;
d[i][j]=1e18;
for(int k=i+1; k<j; k++)
d[i][j]=min(d[i][j],d[i][k]+d[k][j]+1LL*v[i]*v[k]*v[j]);
}
printf("%lld",d[1][n]);
return 0;
}