Cod sursa(job #2791113)
Utilizator | Chiriac Matei Chirac_Matei | Data | 30 octombrie 2021 09:29:45 |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("podm.in");
ofstream fout ("podm.out");
long long n;
long long d[505];
long long dp[505][505];
int main()
{
fin>>n;
for(int i=0;i<=n;i++)
fin>>d[i];
for(int i=n; i>=1; i--)
for(int j=i+1; j<=n;j++)
{
dp[i][j]=1e18;
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]);
}
fout<<dp[1][n];
return 0;
}