Pagini recente » Cod sursa (job #1480374) | Cod sursa (job #1254707) | Cod sursa (job #83563) | Cod sursa (job #1846969) | Cod sursa (job #1807114)
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
int n,v[501];
long long dp[501][501];
scanf("%d",&n);
for(int i=0;i<=n;++i) scanf("%d",&v[i]);
for(int i=1;i<n;++i)
for(int j=i+1;j<=n;++j)
{
long long m=1LL<<60;
int x=v[j-i-1]*v[j];
for(int k=j-i;k<j;++k)
m=min(m,dp[j-i][k]+dp[k+1][j]+1LL*x*v[k]);
dp[j-i][j]=m;
}
printf("%lld",dp[1][n]);
return 0;
}