Mai intai trebuie sa te autentifici.
Cod sursa(job #3281796)
| Utilizator | Data | 3 martie 2025 17:36:33 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.8 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long dp[505] [505];
int L[505];
int c[505];
int main() {
int n;
fin >> n;
int prv;
fin >> prv;
for (int i = 1; i <= n; i++) {
L[i] = prv;
fin >> prv;
c[i] = prv;
}
for (int i = 1; i <= n; i++) {
dp[i][i] = 0; }
for (int st = n - 1; st >= 1; st -- )
{
for (int dr = st + 1; dr <= n; dr++)
{
dp[st][dr] = 1e18;
for(int k = st; k < dr; k++)
{
long long inm = 1LL * L[st] * c[k] * c[dr];
dp[st][dr] = min(dp[st][dr], dp[st][k] + dp[k + 1][dr] + inm);
}
}
}
fout << dp[1][n];
return 0;
}
