Cod sursa(job #3292585)
| Utilizator | Data | 8 aprilie 2025 17:16:14 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n, m, i, j, k, a[502], d[502][502];
int main() {
fin >> n;
for(i = 1; i <= n + 1; i++) fin >> a[i];
for(i = 3; i <= n + 1; i++) {
for(j = i - 2; j >= 1; j--) {
d[j][i] = INT_MAX;
for(k = j + 1; k < i; k++) {
d[j][i] = min(d[j][i], d[j][k] + d[k][i] + a[j] * a[k] * a[i]);
}
}
}
fout << d[1][n + 1];
return 0;
}
