Pagini recente » Cod sursa (job #903154) | Cod sursa (job #2727461) | Cod sursa (job #142921) | Cod sursa (job #2755629) | Cod sursa (job #1045499)
#include<cstdio>
#include<algorithm>
#define NMAX 505
using namespace std;
long long D[NMAX],M[NMAX][NMAX];
int N,i,j,d;
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
scanf("%d",&N);
for(i=0;i<=N;i++) scanf("%lld",&D[i]);
for(i=1;i<=N-1;i++) M[i][i+1]=D[i-1]*D[i]*D[i+1];
for(d=2;d<=N-1;d++)
for(i=1;i<=N-d;i++)
{
M[i][i+d]=M[i][i]+M[i+1][i+d]+D[i-1]*D[i]*D[i+d];
for(j=i+1;j<=N-1;j++)
M[i][i+d]=min(M[i][i+d],M[i][j]+M[j+1][i+d]+D[i-1]*D[j]*D[i+d]);
}
printf("%lld\n",M[1][N]);
return 0;
}