Pagini recente » Cod sursa (job #1408959) | Cod sursa (job #152222) | Cod sursa (job #1265260) | Cod sursa (job #826495) | Cod sursa (job #2585234)
#include <iostream>
#include <vector>
#include <stdlib.h>
#include <fstream>
using namespace std;
int main() {
ifstream in("podm.in");
int n;
in >> n;
std::vector <int> v;
for (int i = 0; i <= n; ++i) {
int x;
cin >> x;
v.push_back(x);
}
vector<vector<unsigned long long>> dp(n + 1, vector<unsigned long long>(n + 1));
for (int i = 1; i <= n; ++i) {
dp[i][i] = 0;
}
for (int i = 1; i < n; ++i) {
dp[i][i + 1] = 1ULL * v[i - 1] * v[i] * v[i + 1];
}
for (int len = 2; len <= n; ++len) {
for (int i = 1; i + len - 1 <= n; ++i) {
int j = i + len - 1;
for (int k = i; k < j; ++k) {
if (dp[i][j] != 0)
dp[i][j] = std::min(dp[i][j], dp[i][k] + dp[k + 1][j] + 1LL * v[i - 1] * v[k] * v[j]);
else dp[i][j] = dp[i][j] = dp[i][k] + dp[k + 1][j] + 1LL * v[i - 1] * v[k] * v[j];
}
}
}
ofstream fout("podm.out");
fout << dp[1][n];
in.close();
fout.close();
return 0;
}