Pagini recente » Cod sursa (job #2268405) | Cod sursa (job #2471523) | Cod sursa (job #2635354) | Cod sursa (job #861354) | Cod sursa (job #2799315)
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
long long dp[505][505],v[505];
int main()
{
ifstream fin("podm.in");
ofstream fout("podm.out");
int n,j;
fin >> n;
for (int i = 0;i <= n;i++)
fin >> v[i];
for (int i = 1;i < n;i++)
dp[i][i + 1] = v[i - 1] * v[i] * v[i + 1];
for (int k = 2;k < n;k++) {
for (int i = 1;i < n - k + 1;i++) {
j = i + k;
dp[i][j] = INF;
for (int q = i;q < j;q++)
dp[i][j] = min(dp[i][j], dp[i][q] + dp[q + 1][j] + v[i - 1] * v[q] * v[j]);
}
}
fout << dp[1][n];
return 0;
}