Pagini recente » Cod sursa (job #933527) | Cod sursa (job #2082584) | Cod sursa (job #1333213) | Cod sursa (job #2048304) | Cod sursa (job #2840358)
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
const int NMAX = 505;
int v[NMAX];
long long dp[NMAX][NMAX];
int main()
{
int n;
fin >> n;
for(int i = 1; i <= n + 1; i++)
{
fin >> v[i];
}
for(int i = n; i >= 1; i--)
{
for(int j = i + 1; j <= n; j++)
{
dp[i][j] = 1LL << 60;
for(int k = i; k < j; k++)
{
long long q = dp[i][k] + dp[k+1][j] + (long long)v[i] * v[k+1] * v[j+1];
dp[i][j] = min(dp[i][j], q);
}
}
}
fout << dp[1][n];
return 0;
}