Pagini recente » Cod sursa (job #2809452) | Cod sursa (job #3195179) | Cod sursa (job #2695380) | Cod sursa (job #3293511) | Cod sursa (job #370174)
Cod sursa(job #370174)
#include<stdio.h>
short int n,v[501];
long long d[501][501];
inline long long min(long long a, long long b)
{
if(a<b)
return a;
return b;
}
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
scanf("%hd",&n);
int i,j,k;
long long sol;
for(i=0;i<=n;i++)
scanf("%hd",&v[i]);
for(i=n;i>=1;i--)
for(j=i+1;j<=n;j++)
{
sol=d[i+1][j]+(long long)v[i-1]*v[i]*v[j];
for(k=i+1;k<j;k++)
sol=min(sol,d[i][k]+d[k+1][j]+(long long)v[i-1]*v[k]*v[j]);
d[i][j]=sol;
}
printf("%lld\n",d[1][n]);
return 0;
}