Pagini recente » Cod sursa (job #3156415) | Cod sursa (job #2987264) | Cod sursa (job #2039231) | Cod sursa (job #2542066) | Cod sursa (job #2442328)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
#define INF 100000000000000000LL
int main(){
int n;
long long dp[505][505],d[505];
fin >> n;
for(int i = 0; i <= n; i++){
fin >> d[i];
}
for(int i = 1; i <=n; i++){
dp[i][i] = 0;
}
for(int i = 1; i < n; i++){
dp[i][i+1] = d[i-1]*d[i]*d[i+1];
}
for(int l = 2; l < n; l++){
for(int i = 1; i <= n - l; i++){
int j = i + l;
dp[i][j] = INF;
for(int k = i; k <= j-1; k++){
dp[i][j] = min(dp[i][j],dp[i][k]+dp[k+1][j]+(d[i-1]*d[k]*d[j]));
}
}
}
fout << dp[1][n];
return 0;
}