Pagini recente » Borderou de evaluare (job #2674813) | Cod sursa (job #223292) | Borderou de evaluare (job #2267701) | Borderou de evaluare (job #2960318) | Cod sursa (job #505608)
Cod sursa(job #505608)
#include<stdio.h>
const int INF =1000000050;
int n, v[505],a[505][505],i,j,k;
int min (int a, int b)
{
if (a<b) return a;
return b;
}
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n+1;i++)
scanf("%d",&v[i]);
for(i=n;i>=1;--i)
for(j=i+1;j<=n;++j)
{
a[i][j]=INF;
for(k=i;k<j;k++)
a[i][j]=min(a[i][j],a[i][k]+a[k+1][j]+v[i]*v[k+1]*v[j+1]);
}
printf("%d",a[1][n]);
return 0;
}