Pagini recente » Cod sursa (job #2619015) | Cod sursa (job #2676571) | Cod sursa (job #147133) | Cod sursa (job #2078060) | Cod sursa (job #508621)
Cod sursa(job #508621)
#include<cstdio>
int main()
{
int n,i,j,k,max;
int a[501][501];
int x[101];
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;++i)
{
scanf("%d",&x[i]);
a[i][i]=0;
}
for (i=n;i>=1;--i)
for (j=i+1;j<=n;++j)
{
max=1<<30;
for (k=i;k<j;++k)
if (a[i][k]+a[k+1][j]+x[i]*x[j+1]*x[k+1]<max)
max=a[i][k]+a[k+1][j]+x[i]*x[j+1]*x[k+1];
a[i][j]=max;
}
printf("%d",a[1][n]);
return 0;
}