Pagini recente » Cod sursa (job #2508176) | Cod sursa (job #2706312) | Cod sursa (job #493522) | Cod sursa (job #2558364) | Cod sursa (job #2320394)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
#define NMax 510
#define inf (1 << 30) - 1
int n;
int d[NMax];
int c[NMax][NMax];
void citire();
void rezolvare();
int main(){
citire();
rezolvare();
}
void citire(){
fin >> n;
for(int i = 0; i <= n; i++)
fin >> d[i];
}
void rezolvare(){
int l, i, j, k, p;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if(i != j) c[i][j] = inf;
for(l = 2; l <= n; l++)
for(i = 1; i <= n - l + 1; i++){
j = i + l - 1;
for(k = i; k < j; k++){
p = (d[i - 1] * d[k] * d[j]) + c[i][k] + c[k + 1][j];
if(c[i][j] > p) c[i][j] = p;
}
}
fout << c[1][n];
}