Pagini recente » Cod sursa (job #3177487) | Cod sursa (job #2514184) | Cod sursa (job #2468033) | Cod sursa (job #2831004) | Cod sursa (job #380939)
Cod sursa(job #380939)
#include<stdio.h>
#define N 1001
long long int a[N][N];
int n, v[N];
void citire();
void calcul();
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
citire();
calcul();
printf("%lld ", a[1][n]);
return 0;
}
void citire()
{
scanf("%d ", &n);
for(int i=0;i<=n;++i)
scanf("%d ", &v[i]);
}
void calcul()
{
for(int d=1; d<=n;++d)
for(int i=1;i<=n-d;++i)
{
long long int j=d+i;
a[i][j]=(long long) 1<<62;
for(int k=1;k<j;++k)
{
long long int soparla=a[i][k]+a[k+1][j]+(long long)v[i-1]*v[k]*v[j];
if(soparla<a[i][j])
a[i][j]=soparla;
}
}
}