Pagini recente » Cod sursa (job #2216886) | Cod sursa (job #2223370) | Cod sursa (job #1149187) | Cod sursa (job #487916) | Cod sursa (job #2812558)
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long int v[505], dp[505][505];
int n;
int main() {
fin >> n;
for (int i = 0; i <= n; i++) {
fin >> v[i];
}
for (int i = 1; i < n; i++) {
dp[i][i + 1] = v[i - 1] * v[i] * v[i + 1];
}
for(int len = 2; len < n; len++) {
for (int i = 1; i <= n - len; i++) {
int j = i + len;
dp[i][j] = 1e18;
for (int k = i; k < j; k++) {
dp[i][j] = min(dp[i][j], v[i - 1] * v[k] * v[j] + dp[i][k] + dp[k + 1][j]);
}
}
}
fout << dp[1][n];
return 0;
}