Pagini recente » Cod sursa (job #288991) | Cod sursa (job #2742926) | Cod sursa (job #1898024) | Cod sursa (job #1139502) | Cod sursa (job #1227518)
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int v[510],n,i,j,q;
long long int din[510][510];
const long long inf=1LL<<60;
int main()
{
freopen("podm.in", "r", stdin);
freopen("podm.out", "w", stdout);
scanf("%d",&n);
for(i=0;i<=n;i++) scanf("%d",&v[i]);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
din[i][j]=inf;
din[n][n]=0;
for(i=n-1;i;i--)
{
din[i][i]=0;
for(j=i+1;j<=n;j++)
for(q=i;q<j;q++)
din[i][j]=min(din[i][j],din[i][q]+v[i-1]*v[q]*v[j]+din[q+1][j]);
}
printf("%lld",din[1][n]);
return 0;
}