Pagini recente » Cod sursa (job #2594868) | Cod sursa (job #683072) | Cod sursa (job #1763077) | Cod sursa (job #2905174) | Cod sursa (job #2227756)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
long long n;
long long d[505];
long long dp[505][505];
int main()
{
f >> n;
for (int i=1; i<=n+1; i++)
{
f >> d[i];
}
for (int i=1; i<=n; i++)
{
for (int j=1; j+i<=n; j++)
{
int l=j;
int c=j+i;
long long mini=(1LL<<60);
for (int k=l; k<c; k++)
{
if (mini>(dp[l][k]+dp[k+1][c]+d[l]*d[k+1]*d[c+1]))
{
mini=(dp[l][k]+dp[k+1][c]+d[l]*d[k+1]*d[c+1]);
}
}
dp[l][c]=mini;
}
}
cout << dp[1][n];
return 0;
}