Pagini recente » Cod sursa (job #365590) | Cod sursa (job #351040) | Rating Cornescu Mihail (legendary28) | Cod sursa (job #441485) | Cod sursa (job #1774541)
#include<bits/stdc++.h>
#define INF LLONG_MAX
using namespace std;
int n;
long long m[505][505],v[510],minim;
inline long long min(long long a,long long b)
{
return a<b?a:b;
}
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
scanf("%d",&n);
for(int i=0;i<=n;i++) scanf("%lld",&v[i]);
for(int i=1;i<=n;i++) m[i][i]=0;
for(int i=1;i<n;i++) m[i][i+1]=v[i-1]*v[i]*v[i+1];
for(int d=2;d<n;d++)
{
for(int i=1;i<=(n-d);i++)
{
minim=INF;
for(int k=i;k<(i+d);k++)
{
minim=min(minim,m[i][k]+m[k+1][i+d]+(v[i-1]*v[k]*v[i+d]));
}
m[i][i+d]=minim;
}
}
printf("%lld\n",m[1][n]);
return 0;
}