Pagini recente » Cod sursa (job #2788148) | Cod sursa (job #1482948) | Cod sursa (job #2028318) | Cod sursa (job #1849547) | Cod sursa (job #2023908)
#include <iostream>
#include <cstdio>
using namespace std;
const int max1=123456789;
long long dp[510][510],d[510];
int n;
void citire()
{
scanf("%d",&n);
for(int i=0;i<=n;i++)
scanf("%lld",&d[i]);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
dp[i][j]=max1;
}
void operatii()
{
for(int i=1;i<=n;i++)
{
dp[i][i]=0;
dp[i][i+1]=d[i-1]*d[i]*d[i+1];
}
for(int d1=2;d1<=n;d1++)
{
for(int i=1;i+d1<=n;i++)
{
for(int k=i;k<=i+d1;k++)
{
dp[i][i+d1]=min(dp[i][i+d1],dp[i][k]+dp[k+1][i+d1]+d[i-1]*d[k]*d[i+d1]);
}
}
}
}
void afisare()
{
printf("%lld",dp[1][n]);
}
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
citire();
operatii();
afisare();
// cout << "Hello world!" << endl;
return 0;
}