Pagini recente » Cod sursa (job #385158) | Cod sursa (job #2795819) | Cod sursa (job #1048288) | Cod sursa (job #2807958) | Cod sursa (job #2170580)
#include <bits/stdc++.h>
using namespace std;
#if 1
#define pv(x) cout<<#x<<" = "<<x<<"; ";cout.flush()
#define pn cout<<endl
#else
#define pv(x)
#define pn
#endif
#ifdef ONLINE_JUDGE
#define in cin
#define out cout
#else
ifstream in("podm.in");
ofstream out("podm.out");
#endif
using ll = long long;
using ull = unsigned long long;
using ui = unsigned int;
#define pb push_back
#define mp make_pair
const int NMax = 5e2 + 5;
const ll inf_ll = 1e18 + 5;
const int inf_int = 1e9 + 5;
const int mod = 100003;
using zint = int;
ll N;
ll dim[NMax],dp[NMax][NMax];
int main() {
in >> N;
for (int i = 1;i <= N + 1;++i) {
in >> dim[i];
}
for (int nr = 2;nr <= N;++nr) {
for (int i = 1;i + nr - 1 <= N;++i) {
int j = i + nr - 1;
dp[i][j] = inf_ll;
for (int k = i;k < j;++k) {
ll val = dp[i][k] + dp[k+1][j] + dim[i] * dim[k+1] * dim[j+1];
dp[i][j] = min(dp[i][j],val);
}
}
}
out << dp[1][N];
return 0;
}