Pagini recente » preONI 2007, Runda 1, Clasa a 9-a si gimnaziu | Cod sursa (job #3287841) | Cod sursa (job #3199520) | Cod sursa (job #553218) | Cod sursa (job #392003)
Cod sursa(job #392003)
#include <stdio.h>
#define max 1010
int m[max][max],d[max],n,i,j,min,kmin,k;
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
scanf("%d",&n);
for(i=0; i<=n; i++) scanf("%d",&d[i]);
for(int nr=2; nr<=n; nr++)
for(i=1; i<=n-nr+1; i++)
{
j=i+nr-1;
for(k=i,min=1<<30; k<j; k++)
if(min>m[i][k]+m[k+1][j]+d[i-1]*d[k]*d[j])
{
min=m[i][k]+m[k+1][j]+d[i-1]*d[k]*d[j];
kmin=k;
}
m[i][j]=min;
m[j][i]=kmin;
}
printf("%d",m[1][n]);
return 0;
}