Cod sursa(job #2840366)
| Utilizator | Data | 27 ianuarie 2022 15:47:11 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
long long dp[505][505];
long long v[505];
ifstream in("podm.in");
ofstream out("podm.out");
int main()
{
int n;
in>>n;
for(int i=1; i<=n+1; i++){
in>>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]);
}
}
}
out<<dp[1][n];
return 0;
}
