Pagini recente » Cod sursa (job #1270753) | Cod sursa (job #977106) | Cod sursa (job #1917630) | Cod sursa (job #2674074) | Cod sursa (job #2246465)
#include <fstream>
using namespace std;
ifstream cin("podm.in");
ofstream cout("podm.out");
const int MAX = 501;
const long long INF = (1ll << 60);
int n, v[MAX];
long long dp[MAX][MAX];
int main()
{
cin >> n;
for(int i = 0; i <= n; ++i) {
cin >> v[i];
}
for(int d = 2; d <= n; ++d) {
for(int i = 1, j = d; j <= n; ++i, ++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 * v[i-1] * v[k] * v[j]);
}
}
}
cout << dp[1][n];
return 0;
}