Pagini recente » Cod sursa (job #656727) | Cod sursa (job #1425833) | Cod sursa (job #931826) | Cod sursa (job #1848306) | Cod sursa (job #2895772)
#include <bits/stdc++.h>
using namespace std;
long long dp[505][505];
long long v[505];
long long n;
int main()
{
freopen("podm.in", "r", stdin);
freopen("podm.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n+1; i++)
cin >> v[i];
for (int i = 1; i <= n-1; i++) {
dp[i][i+1] = v[i]*v[i+1]*v[i+2];
}
for (int d = 1; d < n; ++d)
for (int i = 1; i + d <= n; ++i) {
dp[i][i + d] = 1LL << 60;
for (int k = i, j = i + d; k < j; ++k)
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + 1LL * v[i] * v[k + 1] * v[j + 1]);
}
cout << dp[1][n];
return 0;
}