Cod sursa(job #3268582)
| Utilizator | Data | 16 ianuarie 2025 10:37:33 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
int n;
long long d[506], dp[506][506];
int main()
{
f >> n;
for(int i = 0; i <= n; i++)
f >> d[i];
for(int len = 2; len <= n; len++)
for(int i = 1, j = len; j <= n; i++, j++)
{
dp[i][j] = 0x3F3F3F3F;
for(int k = i; k < j; k++)
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j] + d[i-1]*d[k]*d[j]);
}
g << dp[1][n];
return 0;
}
