Pagini recente » Cod sursa (job #1205009) | Cod sursa (job #788599) | Cod sursa (job #1101018) | Cod sursa (job #573442) | Cod sursa (job #2840361)
#include <fstream>
using namespace std;
long long dp[505][505];
long long v[505];
int main() {
ifstream in("podm.in");
ofstream out("podm.out");
int n;
in >> n;
for (int i = 0; i <= n; i++)
in >> v[i];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
dp[i][j] = 1e18;
dp[i][i] = 0;
}
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++)
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + v[i - 1] * v[k] * v[j]);
}
out << dp[1][n] << "\n";
return 0;
}