Pagini recente » Cod sursa (job #2222301) | Cod sursa (job #2075055) | Cod sursa (job #473070) | Cod sursa (job #1185480) | Cod sursa (job #1698762)
#include<cstdio>
long long a[501][501];
long long v[501];
int main(){
int n,i,ii,jj,k,nr;
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
scanf("%d",&n);
for(i=0;i<=n;i++)
scanf("%d",&v[i]);
for(i=2;i<=n;i++){
ii=1;
jj=i;
while(jj<=n){
a[ii][jj]=((1LL<<62)-1)*2+1;
for(k=ii;k<jj;k++){
nr=a[ii][k]+a[k+1][jj]+v[ii-1]*v[k]*v[jj];
if(nr<a[ii][jj])
a[ii][jj]=nr;
}
ii++;
jj++;
}
}
printf("%lld",a[1][n]);
return 0;
}