Cod sursa(job #2976188)
Utilizator | Data | 8 februarie 2023 16:23:12 | |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream cin("podm.in");
ofstream cout("podm.out");
const long long INF = 1e18;
long long a[501], dp[501][501], n;
int main()
{
cin >> n;
for(int i = 1; i <= n + 1; i++)
cin >> a[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] + a[i] * a[j + 1] * a[k + 1]);
}
cout << dp[1][n] << "\n";
return 0;
}