Cod sursa(job #2976181)
| Utilizator | Data | 8 februarie 2023 16:19:57 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
string file = "podm";
ifstream cin(file + ".in");
ofstream cout(file + ".out");
int dp[501][501], dim[502];
const int INF = 1e9;
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n+1; i++)
{
cin >> dim[i];
}
for (int i = n; i >= 1; i--)
{
for (int j = i + 1; j <= n; j++)
{
dp[i][j] = INF;
for (int k = i; k < j; k++)
{
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + dim[i] * dim[k + 1] * dim[j + 1]);
}
}
}
cout << dp[1][n];
}