Pagini recente » Cod sursa (job #1964176) | Cod sursa (job #3282716) | Cod sursa (job #1606601) | Cod sursa (job #3197146) | Cod sursa (job #397378)
Cod sursa(job #397378)
#include <cstdio>
long long n,v[505];
long long a[505][505];
int main()
{
freopen ("podm.in","r",stdin);
freopen ("podm.out","w",stdout);
scanf("%lld",&n);
for (int i=1;i<=n+1;++i)
scanf("%lld",&v[i]);
for (int d=2;d<=n;++d)
for (int i=1;i<=n-d+1;++i)
{
int j=i+d-1;
long long min=-1;
for (int k=i;k<j;++k)
{
long long x=a[i][k]+a[k+1][j]+v[i]*v[k+1]*v[j+1];
if (min==-1)
min=x;
if (x<min)
min=x;
}
a[i][j]=min;
}
printf("%lld",a[1][n]);
return 0;
}