Cod sursa(job #1753931)
| Utilizator | Data | 7 septembrie 2016 12:35:02 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
const long long inf=10000000000000000;
long long v[510],d[510][510];
int main()
{
freopen("podm.in", "r", stdin);
freopen("podm.out", "w", stdout);
int n;
scanf("%d",&n);
for(int i=1;i<=n+1;i++) scanf("%lld",&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]+v[i]*v[k+1]*v[j+1]);
}
printf("%lld",d[1][n]);
return 0;
}
