Cod sursa(job #2373645)
| Utilizator | Data | 7 martie 2019 14:42:01 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
#define LMAX 505
int v[LMAX];
long long dp[LMAX][LMAX];
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 d=1;d<=n;++d)
for(int i=1;i<=n-d;++i){
dp[i][i+d]=LLONG_MAX/2;
for(int k=i+1;k<=i+d;++k)
dp[i][i+d]=min(dp[i][i+d],dp[i][k-1]+dp[k][i+d]+1LL*v[i-1]*v[k-1]*v[i+d]);
}
printf("%lld\n",dp[1][n]);
return 0;
}
