Pagini recente » Cod sursa (job #1628954) | Cod sursa (job #774113) | Cod sursa (job #369919) | Cod sursa (job #1236790) | Cod sursa (job #2718441)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
const int NMax = 5 * 1e2;
const long long oo = 1e17;
int n;
long long d[NMax + 5], dp[NMax + 5][NMax + 5];
void Read(){
fin >> n;
for (int i = 0; i <= n; i++)
fin >> d[i];
}
void DP(){
for (int i = 1; i < n; i++)
dp[i][i + 1] = d[i - 1] * d[i] * d[i + 1];
for (int diff = 2; diff < n; diff++)
for (int i = 1; i + diff <= n; i++){
long long minvalue = oo;
for (int j = i + 1; j <= i + diff; j++)
if (dp[i][j - 1] + dp[j][i + diff] + d[i - 1] * d[j - 1] * d[i + diff] < minvalue)
minvalue = dp[i][j - 1] + dp[j][i + diff] + d[i - 1] * d[j - 1] * d[i + diff];
dp[i][i + diff] = minvalue;
}
}
void Print(){
fout << dp[1][n] << '\n';
}
int main(){
Read();
DP();
Print();
return 0;
}