Pagini recente » Cod sursa (job #1831779) | Cod sursa (job #243394) | Cod sursa (job #1016292) | Cod sursa (job #2330362) | Cod sursa (job #2565492)
#include <bits/stdc++.h>
using namespace std;
const int DIM = 505;
long long val[DIM], dp[DIM][DIM];
int main(void) {
freopen("podm.in", "r", stdin);
freopen("podm.out", "w", stdout);
int n; cin >> n; ++n;
for (int i = 1; i <= n; ++i)
cin >> val[i];
for (int i = n - 2; i >= 1; --i)
for (int j = i + 2; j <= n; ++j) {
dp[i][j] = (1LL << 60);
for (int k = i + 1; k < j; ++k)
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j] + val[i] * val[k] * val[j]);
}
cout << dp[1][n] << endl;
return 0;
}