Pagini recente » Cod sursa (job #2863625) | Cod sursa (job #1490033) | Cod sursa (job #3170173) | Cod sursa (job #1628269) | Cod sursa (job #2696098)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
long long dp[502][502];
int a[502];
int main()
{
int n;
in>>n;
for(int i=1; i<=n+1; i++)
in>>a[i];
for(int i=n-1; i>=1; i--)
{
for(int j=i+1; j<=n; j++)
{
if(i!=j)
{
dp[i][j]=1<<30;
for(int k=i; k<j; k++)
{
dp[i][j]=min(dp[i][j], dp[i][k]+dp[k+1][j] + (long long)a[i]*a[k+1]*a[j+1]);
}
}
}
}
out<<dp[1][n];
return 0;
}