Cod sursa(job #386364)
Utilizator | Borsos Zalan borsoszalan | Data | 24 ianuarie 2010 18:51:17 |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<stdio.h>
#define nmax 505
int n,i,j,k, v[nmax],nr;
long long m[nmax][nmax];
long long int min;
int main()
{
freopen("podm.in", "r", stdin);
freopen("podm.out", "w", stdout);
scanf("%d", &n);
for(i=1;i<=n+1;i++)
scanf("%d", &v[i]);
for(nr=2;nr<=n;nr++)
for(i=1;i<=n-nr+1;i++)
{
j=i+nr-1;
min=100000000;
for(k=i;k<j;k++)
if(min>m[i][k]+m[k+1][j]+v[i+1]*v[k+1]*v[j+1])
min=m[i][k]+m[k+1][j]+v[i]*v[k+1]*v[j+1];
m[i][j]=min;
}
printf("%lld\n", m[1][n]);
return 0;
}