Pagini recente » Cod sursa (job #1856165) | Cod sursa (job #710972) | Cod sursa (job #2284544) | Cod sursa (job #2065780) | Cod sursa (job #1714210)
#include <iostream>
#include <cstdio>
#define Max 500
using namespace std;
long long a[Max][Max],d[Max+10],n;
void citire()
{
scanf("%d",&n);
for(int i=0;i<=n;i++)
scanf("%d",&d[i]);
}
void sol()
{
for(int i=1;i<n;i++)
a[i][i+1]=d[i-1]*d[i]*d[i+1];
for(int l=2;l<n;l++)
for(int i=n-l;i>=1;i--)
{
int j=i+l;
int k=i;
long long m=a[i][k]+a[k+1][j]+d[i-1]*d[k]*d[j];
for(k=i+1;k<j;k++)
m=min(a[i][k]+a[k+1][j]+d[i-1]*d[k]*d[j],m);
a[i][j]=m;
}
printf("%lld",a[1][n]);
}
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
citire();
sol();
return 0;
}