Pagini recente » Cod sursa (job #1426129) | Monitorul de evaluare | Cod sursa (job #2368142) | Cod sursa (job #2272582) | Cod sursa (job #1922597)
#include <cstdio>
#include <algorithm>
using namespace std;
const long long inf=1e18;
long long d[510][510];
int v[510];
int main()
{
freopen("podm.in", "r", stdin);
freopen("podm.out", "w", stdout);
int n;
scanf("%d",&n);
for(int i=0;i<=n;i++) scanf("%d",&v[i]);
for(int l=2;l<=n;l++)
for(int i=1,j=l;j<=n;i++,j++)
{
d[i][j]=inf;
for(int k=i;k<j;k++)
d[i][j]=min(d[i][j],d[i][k]+d[k+1][j]+1LL*v[i-1]*v[k]*v[j]);
}
printf("%lld",d[1][n]);
return 0;
}