Pagini recente » Cod sursa (job #1012914) | Arhiva de probleme | Cod sursa (job #439871) | Istoria paginii utilizator/ovi2302 | Cod sursa (job #2390979)
#include<cstdio>
#define N 15000000
long long a[501][501],m,d[501];
int i,n,j,k;
char r[N];
int A()
{
int s=0;
for(o++;r[o]>='0'&&r[o]<='9';o++)
s=s*10+r[o]-'0';
return s;
}
int main()
{
freopen("podm.in","r",stdin),freopen("podm.out","w",stdout),fread(r,1,N,stdin),n=A();
for(i=0;i<=n;i++)
d[i]=A();
for(i=1;i<n;i++)
a[i][i+1]=d[i-1]*d[i]*d[i+1];
for(j=2;j<n;j++)
for(i=1;i<=n-j;i++)
for(a[i][i+j]=1LL<<62,k=i;k<i+j;k++)
if(a[i][i+j]>(m=a[i][k]+a[k+1][i+j]+d[i-1]*d[k]*d[i+j]))
a[i][i+j]=m;
printf("%lld",a[1][n]);
}