Cod sursa(job #3281189)
| Utilizator | Data | 28 februarie 2025 17:02:18 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n, v[501], dp[501][501];
int main()
{
fin >> n;
for (int i = 0; i <= n; i ++)
fin >> v[i];
for (int lung = 2; lung <= n; lung ++)
{
for (int i = 1; i <= n - lung + 1; i ++)
{
int j = i + lung - 1;
dp[i][j] = 1e9;
for (int k = i; k < j; k ++)
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + v[i - 1] * v[k] * v[j]);
}
}
fout << dp[1][n];
return 0;
}
