Pagini recente » Cod sursa (job #982010) | Cod sursa (job #265835) | Cod sursa (job #3147835) | Cod sursa (job #3121406) | Cod sursa (job #2715164)
#include <fstream>
using namespace std;
ifstream cin("podm.in");
ofstream cout("podm.out");
const int NMAX = 500;
const long long INF = 1e18;
int N, d[NMAX + 5];
long long dp[NMAX + 5][NMAX + 5];
int main() {
cin >> N;
for(int i = 1; i <= N + 1; i++) {
cin >> d[i];
}
for(int i = N - 1; i >= 1; i--) {
for(int j = i + 1; j <= N; j++) {
dp[i][j] = INF;
for(int k = i; k < j; k++) {
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + 1LL * d[i] * d[k + 1] * d[j + 1]);
}
}
}
cout << dp[1][N] << '\n';
return 0;
}