Mai intai trebuie sa te autentifici.
Cod sursa(job #714810)
| Utilizator | Data | 16 martie 2012 10:41:55 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include<cstdio>
using namespace std;
long long n,v[511],a[511][511];
void read()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
scanf("%lld",&n);
int i;
for(i=1;i<=n+1;i++)
scanf("%lld",&v[i]);
}
void rez()
{
long long min,val,i,j,k;
for(i=n;i>=1;i--)
for(j=i+1;j<=n;j++)
{
min=9223372036854775805LL;
for(k=i;k<j;k++)
{
val=a[i][k]+a[k+1][j]+v[i]*v[k+1]*v[j+1];
if(val<min)
min=val;
}
a[i][j]=min;
}
printf("%lld\n",a[1][n]);
}
int main()
{
read();
rez();
return 0;
}
