Pagini recente » Cod sursa (job #2551517) | Cod sursa (job #2542213) | Cod sursa (job #3149736) | Cod sursa (job #2539435) | Cod sursa (job #819565)
Cod sursa(job #819565)
#include<cstdio>
int d[1001][1001],i,j,pre,v[1001][1001],n,a[1000],k;
int minim(int x ,int y)
{
return (x<y) ? x:y;
}
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
scanf("%d",&n);
for(i=1; i<=n+1; ++i)
scanf("%d",&a[i]);
for(i=n; i>=1; --i)
{
for(j=i+1; j<=n; j++)
{
pre=999999999;
for(k=i; k<j; ++k)
pre=minim(pre,v[i][k]+v[k+1][j]+a[i]*a[k+1]*a[j+1]);
v[i][j]=pre;
}
}
printf("%d",v[1][n]);
}