Cod sursa(job #2840364)
Utilizator | Data | 27 ianuarie 2022 15:46:22 | |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
using namespace std;
long long dp[505][505];
long long v[505];
int main()
{
int n;
cin>>n;
for(int i=1; i<=n+1; i++){
cin>>v[i];
}
for(int i=n; i>=1; i--){
for(int j=i+1; j<=n; j++){
dp[i][j]=1e18;
for(int k=i; k<j; k++){
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+(long long)v[i]*v[k+1]*v[j+1]);
}
}
}
cout<<dp[1][n];
return 0;
}