Pagini recente » Cod sursa (job #2842312) | Cod sursa (job #918032) | Cod sursa (job #111757) | Cod sursa (job #2566499) | Cod sursa (job #2758525)
#include <fstream>
using namespace std;
ifstream cin ("podm.in");
ofstream cout ("podm.out");
const long long INF=100000000000000000;
long long v[505], dp[505][505];
int main()
{
int n;
cin >> n;
for (int i=0; i<=n; i++)
{
cin >> v[i];
}
for (int i=1; i<=n; i++)
{
dp[i][i]=0;
}
for (int i=1; i<=n-1; i++)
{
dp[i][i+1]=v[i-1]*v[i]*v[i+1];
}
for (int d=2; d<n; d++)
{
for (int i=1; i<=n-d; i++)
{
dp[i][i+d]=INF;
for (int k=i; k<i+d; k++)
{
dp[i][i+d]=min(dp[i][i+d],dp[i][k]+dp[k+1][i+d]+v[i-1]*v[k]*v[i+d]);
}
}
}
cout << dp[1][n];
return 0;
}