Pagini recente » Cod sursa (job #2638478) | Cod sursa (job #2463167) | Cod sursa (job #1020113) | Rezultate Info Oltenia 2018 Proba Individuala | Cod sursa (job #2384075)
#include <bits/stdc++.h>
using namespace std;
#define NMAX 750
typedef long long ll;
ll mat[NMAX][NMAX];
ll d[NMAX];
int main(){
freopen("podm.in","r", stdin);
freopen("podm.out", "w", stdout);
int n;
scanf("%d", &n);
for(int i = 0; i<=n; i++){
scanf("%lld", &d[i]);
}
for(int i = 1; i<=n; i++) mat[i][i] = 0;
for(int i = 1; i<n; i++){
mat[i][i+1] = d[i-1]*d[i]*d[i+1];
}
for(int v = 2; v<n; v++){
for(int i = 1; i<=n-v; i++){
int j = v + i;
mat[i][j] = LLONG_MAX;
for(int k = i; k<j; k++){
mat[i][j] = min(mat[i][j], mat[i][k]+mat[k+1][j]+d[i-1]*d[k]*d[j]);
}
}
}
printf("%d", mat[1][n]);
}