Cod sursa(job #392003)
| Utilizator | Data | 6 februarie 2010 16:57:46 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#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;
}
