Pagini recente » Cod sursa (job #1088140) | Cod sursa (job #885415) | Cod sursa (job #1819422) | Cod sursa (job #1183096) | Cod sursa (job #3324036)
#include <bits/stdc++.h>
#define cin fin
#define cout fout
#define ll long long
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
const int NMAX = 500;
const ll INF = 1e18;
int n;
int d[NMAX + 1];
ll dp[NMAX + 1][NMAX + 1];
int main() {
cin >> n;
for(int i = 0; i <= n; i++) {
cin >> d[i];
}
for(int i = n; 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] + (ll) d[i - 1] * d[k] * d[j]);
}
}
}
cout << dp[1][n] << '\n';
return 0;
}