Pagini recente » Cod sursa (job #1890112) | Cod sursa (job #1498644) | Cod sursa (job #1432808) | Cod sursa (job #356484) | Cod sursa (job #2977569)
#include <fstream>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
int n;
int dim[502] , dp[502][502];
const long long INF = 1e28;
int main(){
in >> n;
for(int i = 0 ; i <= n ; i++){
in >> dim[i];
}
for(int i = n ; i >= 1 ; i--){
for(int j = i ; j <= n ; j++){
if(i == j){
dp[i][j] = 0;
}
else{
dp[i][j] = INF;
for(int k = i ; k < j ; k++){
dp[i][j] = min(dp[i][j] , dp[i][k] + dp[k + 1][j] + dim[i - 1] * dim[k] * dim[j]);
}
}
}
}
out << dp[1][n];
}