Pagini recente » Cod sursa (job #573883) | Cod sursa (job #724964) | Cod sursa (job #1765525) | Cod sursa (job #1283887) | Cod sursa (job #2051568)
#include <fstream>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
const int Nmax = 510;
int n;
long long v[Nmax], dp[Nmax][Nmax];
int main()
{
in >> n;
for (int i = 0; i <= n; i++)
in >> v[i];
for (int i = 1; i <= n - 1; i++)
{
for (int j = 1; j <= n - i; j++)
{
dp[j][i + j] = dp[j + 1][i + j] + v[j - 1] * v[j] * v[i + j];
for (int k = j + 1; k <= i + j - 1; k++)
dp[j][i + j] = min (dp[j][i + j], dp[j][k] + dp[k + 1][i + j] + v[j - 1] * v[k] * v[i + j]);
}
}
out << dp[1][n];
return 0;
}