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