Pagini recente » Cod sursa (job #990925) | Cod sursa (job #669058) | Cod sursa (job #1875375) | Cod sursa (job #397226) | Cod sursa (job #678761)
Cod sursa(job #678761)
#include<stdio.h>
int n , i , k , j , d , D[510];
long long V[510][510];
int main(){
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n+1;i++)
scanf("%d",&D[i]);
for(d=2;d<=n;d++){
for(i=1,j=d;j<=n;i++,j++){
for(k=i;k<=j;k++){
if((V[i][k]+V[k+1][j]+(long long)D[i]*D[k+1]*D[j+1])<V[i][j]||V[i][j]==0){
V[i][j]=V[i][k]+V[k+1][j]+(long long)D[i]*D[k+1]*D[j+1];
}
}
}
}
printf("%d",V[1][n]);
return 0;
}