Cod sursa(job #3299871)
| Utilizator | Data | 11 iunie 2025 10:34:59 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
#define int long long
using namespace std;
ifstream fin ("podm.in");
ofstream fout ("podm.out");
int n, v[505], dp[505][505];
signed main ()
{
fin >> n;
for (int i=0; i<=n; i++)
fin >> v[i];
for (int i=1; i<=n-1; i++)
dp[i][i+1]=v[i-1]*v[i]*v[i+1];
for (int lg=2; lg<n; lg++)
{
for (int i=1; i<=n-lg; i++)
{
int j=i+lg;
dp[i][j]=LLONG_MAX;
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;
}
