Pagini recente » Rating Filip Cuciuc (FilipCuciuc) | Cod sursa (job #2565232) | Cod sursa (job #1740314) | Cod sursa (job #2895825) | Cod sursa (job #1616040)
#include <iostream>
#include <algorithm>
#define MAX 99999999
using namespace std;
long long v[505];
long long m[505][505];
int main (void) {
freopen("podm.in", "r", stdin);
freopen("podm.out", "w", stdout);
int n;
cin >> n;
for (int i = 0; i <= n; ++i) {
cin >> v[i];
}
for (int i = 1; i <= n; ++i) {
for (int j = i + 1; j <= n; ++j) {
m[i][j] = MAX;
}
}
for (int inc = 1; inc < n; ++inc) {
for (int i = 1; i <= n - inc; ++i) {
int j = i + inc;
for (int k = i; k < j; ++k) {
m[i][j] = min (m[i][j], m[i][k] + m[k+1][j] + v[i-1] * v[k] * v[j]);
}
}
}
cout << m[1][n];
return 0;
}