Pagini recente » Cod sursa (job #1038406) | Cod sursa (job #2657625) | Cod sursa (job #2394095) | Cod sursa (job #1254237) | Cod sursa (job #883804)
Cod sursa(job #883804)
#include<stdio.h>
#include<algorithm>
using namespace std;
int n,s[510][510],d[510];
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
scanf("%d",&n);
for(int i=0;i<=n;++i)
{
scanf("%d",&d[i]);
}
for(int i=1;i<=n-1;++i)
s[i][i+1]=d[i-1]*d[i]*d[i+1];
for(int j=2;j<=n-1;++j)
for(int i=1;i<=n-j;++i)
{
int mi=s[i][i]+s[i+1][i+j]+d[i-1]*d[i]*d[i+j];
for(int k=i+1;k<i+j;++k)
{
if(s[i][k]+s[k+1][i+j]+d[i-1]*d[k]*d[i+j]<mi)
mi=s[i][k]+s[k+1][i+j]+d[i-1]*d[k]*d[i+j];
}
s[i][i+j]=mi;
}
printf("%d",s[1][n]);
return 0;
}