Cod sursa(job #2957846)
| Utilizator | Data | 23 decembrie 2022 17:36:52 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n, v[501];
long long dp[501][501];
int main(){
fin >> n;
for(int i=0; i<=n; i++){
fin >> v[i];
}
for(int i=1; i<n; i++){
dp[i][i+1]=v[i-1]*v[i]*v[i+1];
}
for(int j=2; j<n; j++){
for(int i=1; i<=n-j; i++){
dp[i][i+j]=dp[i][i]+dp[i+1][i+j]+v[i-1]*v[i]*v[i+j];
for(int k=i+1; k<i+j; k++){
dp[i][i+j]=min(dp[i][i+j], dp[i][k]+dp[k+1][i+j]+v[i-1]*v[k]*v[i+j]);
}
}
}
fout << dp[1][n];
}