Pagini recente » Cod sursa (job #819438) | Cod sursa (job #1864199) | Cod sursa (job #2170595) | Cod sursa (job #960515) | Cod sursa (job #1527634)
#include <cstdio>
using namespace std;
long long d[501][501];
long long a[501];
int main()
{
FILE *in,*out;
in=fopen("podm.in","r");
out=fopen("podm.out","w");
long long n,i,min,var,j,k;
fscanf(in,"%d",&n);
for(i=1;i<=n+1;i++)
fscanf(in,"%lld",&a[i]);
for(i=1;i<=n;i++)
d[i][i]=0;
for(i=n-1;i>=1;i--)
for(j=i+1;j<=n;j++)
{
min=999999;
for(k=i;k+1<=j;k++)
{
if(d[i][k]+d[k+1][j]+a[i]*a[k+1]*a[j+1]<min)
min=d[i][k]+d[k+1][j]+a[i]*a[k+1]*a[j+1];
}
d[i][j]=min;
}
fprintf(out,"%lld",d[1][n]);
return 0;
}