Pagini recente » Cod sursa (job #1090719) | Cod sursa (job #244451) | Cod sursa (job #1432658) | Cod sursa (job #903991) | Cod sursa (job #2477016)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("podm.in");
ofstream cout("podm.out");
int d[505];
int m[505][505];
int main()
{
int n; cin >> n;
for(int i = 0; i <= n; i++) cin >> d[i];
for(int i = 1; i <= n; i++) {
m[i][i] = 0;
}
for(int i = 1; i <= n-1; i++) {
m[i][i+1] = d[i-1]*d[i]*d[i+1];
}
for(int l = 2; l < n; l++)
for(int i = 1; i <= n-l; i++) {
m[i][i+l] = 1e7+8;
for(int k = i; k < i+l; k++) {
m[i][i+l] = min(m[i][i+l], m[i][k] + m[k+1][i+l] + d[i-1]*d[k]*d[i+l]);
}
}
cout << m[1][n];
}