Pagini recente » Cod sursa (job #2760108) | Cod sursa (job #2591308) | Cod sursa (job #2762339) | Cod sursa (job #1691516) | Cod sursa (job #2447267)
#include <iostream>
#include <fstream>
#define inf 1LL*1e18
using namespace std;
unsigned long long m[505], dp[505][505];
int n;
ifstream fin("podm.in");
ofstream fout("podm.out");
int main()
{
fin >> n;
for(int i = 0; i <= n; i++) fin >> m[i];
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
dp[i][j] = inf;
}
}
for(int i = 1; i < n; i++)
{
dp[i][i + 1] = m[i - 1] * m[i] * m[i + 1];
}
for(int i = 1; i <= n; i++)
{
dp[i][i] = 0;
}
for(int l = 3; l <= n; l++)
{
for(int i = 1; i <= n - l + 1; i++)
{
for(int k = i; k < i + l - 1; k++)
{
dp[i][i + l - 1] = min(dp[i][i + l - 1], dp[i][k] + dp[k + 1][i + l - 1] + m[i - 1]*m[k]*m[i + l - 1]);
}
}
}
fout << dp[1][n];
}