Pagini recente » Cod sursa (job #1674175) | Cod sursa (job #2648129) | Cod sursa (job #2763445) | Cod sursa (job #1626547) | Cod sursa (job #1558942)
#include<cstdio>
#include<iostream>
using namespace std;
long long di[505][505],ve[505];
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
int n,i,j,k,st,dr,x;
cin>>n;
n++;
for(i=1;i<=n;i++)
cin>>ve[i];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
di[i][j]=-1;
di[i][i+1]=0;
}
for(k=2;k<n;k++)
for(i=n-k;i>=1;i--)
{
st=i;
dr=i+k;
for(j=st+1;j<dr;j++)
{
x=di[st][j]+di[j][dr]+ve[st]*ve[j]*ve[dr];
if(di[st][dr]>x || di[st][dr]==-1)
di[st][dr]=x;
}
}
cout<<di[1][n]<<"\n";
return 0;
}