Pagini recente » Cod sursa (job #3190988) | Cod sursa (job #441264) | Cod sursa (job #2404170) | Cod sursa (job #1794757) | Cod sursa (job #2212784)
#include <fstream>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
const int MAXN = 500;
const int MAXVAL = 10000;
const int inf = 1e18;
long long int dim[MAXN + 1];
long long int dp[MAXN + 1][MAXN + 1];
int n;
int main() {
in >> n;
for (int i = 0; i <= n; ++ i) {
in >> dim[i];
}
for (int i = 2; i <= n; ++ i) {
for (int j = i; j <= n; ++ j) {
dp[i][j] = inf;
for (int k = 1; k <= i - 1; ++ k) {
dp[i][j] = min(dp[i][j], dp[i - k][j] + dp[k][j - i + k] + (dim[j - i] * dim[j - i + k] * dim[j]));
}
}
}
out << dp[n][n];
return 0;
}