Pagini recente » Cod sursa (job #978059) | Cod sursa (job #1769079) | Cod sursa (job #291531) | Cod sursa (job #1648056) | Cod sursa (job #3152079)
#include <bits/stdc++.h>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
long long n, d[505][505], v[505];
int main()
{
in >> n;
for (int i = 1; i <= n + 1; i++)
in >> v[i];
for (int i = 1; i <= n - 1; i++) {
d[i][i + 1] = v[i] * v[i + 1] * v[i + 2];
}
for (int l = 2; l < n; l++) {
for (int j = 1; j <= n - l; j++) {
d[j][j + l] = 1e9;
for (int k = j; k < j + l; k++)
d[j][j + l] = min(d[j][j + l], d[j][k] + d[k + 1][j + l] + v[j] * v[k + 1] * v[j + l + 1]);
}
}
out << d[1][n] << '\n';
return 0;
}