Pagini recente » Cod sursa (job #510015) | Cod sursa (job #1432030) | Cod sursa (job #999432) | Cod sursa (job #54993) | Cod sursa (job #1897183)
#include<cstdio>
using namespace std;
int d[501],a[501][501],i,j,h,k,n,s;
long long mi;
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
scanf("%d",&n);
for(i=0;i<=n;i++)
scanf("%d",&d[i]);
for(h=2;h<=n;h++)
for(i=1;i<=n-h+1;i++)
{
j=i+h-1;
mi=999999999999999;
for(k=i;k<j;k++)
{
s=a[i][k]+a[k+1][j]+d[i-1]*d[k]*d[j];
if(s<mi)
mi=s;
a[i][j]=mi;
}
}
printf("%d",a[1][n]);
return 0;
}