Pagini recente » Cod sursa (job #1959866) | Cod sursa (job #3219798) | Cod sursa (job #898943) | Cod sursa (job #2798322) | Cod sursa (job #1526320)
#include <cstdio>
using namespace std;
long long v[502];
long long c[502][502];
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
int n;
scanf("%d ",&n);
for (int i=0;i<=n;i++)
scanf("%d ",&v[i]);
for (int i=1;i<=n-1;i++)
c[i][i+1]=v[i-1]*v[i]*v[i+1];
for (int q=2;q<=n-1;q++)
{
for (int i=1;i<=n;i++)
{
int j=i+q;
long long min1=2000000000000;
if (j<=n)
for (int k=i;k<=j-1;k++)
if (c[i][k]+c[k+1][j]+v[i-1]*v[k]*v[j]<min1)
min1=c[i][k]+c[k+1][j]+v[i-1]*v[k]*v[j];
c[i][j]=min1;
}
}
printf("%lld",c[1][n]);
}