Cod sursa(job #1922597)
| Utilizator | Data | 10 martie 2017 17:59:52 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
const long long inf=1e18;
long long d[510][510];
int v[510];
int main()
{
freopen("podm.in", "r", stdin);
freopen("podm.out", "w", stdout);
int n;
scanf("%d",&n);
for(int i=0;i<=n;i++) scanf("%d",&v[i]);
for(int l=2;l<=n;l++)
for(int i=1,j=l;j<=n;i++,j++)
{
d[i][j]=inf;
for(int k=i;k<j;k++)
d[i][j]=min(d[i][j],d[i][k]+d[k+1][j]+1LL*v[i-1]*v[k]*v[j]);
}
printf("%lld",d[1][n]);
return 0;
}
