Mai intai trebuie sa te autentifici.
Cod sursa(job #2976171)
Utilizator | Data | 8 februarie 2023 15:57:46 | |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
const int N = 505;
const float Infinit = 1.e20;
int n,dp[N][N];
int main()
{
fin>>n;
int dim[n+1];
for(int i=1;i<=n+1;i++)
{
fin>>dim[i];
}
for(int i=n;i>=1;i--)
{
for(int j=i+1;j<=n;j++)
{
dp[i][j]=Infinit;
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]));
}
}
}
fout<<dp[1][n];
return 0;
}