Pagini recente » Cod sursa (job #811738) | Cod sursa (job #715217) | Cod sursa (job #3164346) | Cod sursa (job #3170202) | Cod sursa (job #2791212)
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream cin("podm.in");
ofstream cout("podm.out");
long long v[505], dp[505][505], n;
int main()
{
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 0; i <= n; i++)
{
cin >> v[i];
}
for (int l = 2; l <= n; l++)
{
for (int i = 1; i <= n - l + 1; i++)
{
int j = i + l - 1;
dp[i][j] = (1LL << 61);
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]);
}
}
}
cout << dp[1][n];
return 0;
}