Cod sursa(job #2976174)
| Utilizator | Data | 8 februarie 2023 16:04:54 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
const int INF= 1e7;
int n, dim[502], dp[502][502];
int main()
{
in >> n;
for(int i=1; i<=n+1; i++){
in >> dim[i];
}
for(int i=n; i>=1; i--){
for(int j=i+1; j<=n; j++){
dp[i][j]=INF;
for(int k=i; k<j; k++){
dp[i][j]= min(dp[i][j], dp[i][k] + dp[k+1][j] + dim[i] * dim[k+1] * dim[j+1] );
}
}
}
out << dp[1][n];
return 0;
}
