Cod sursa(job #2430722)
| Utilizator | Data | 15 iunie 2019 23:09:24 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#include <climits>
std::ifstream fin("podm.in");
std::ofstream fout("podm.out");
int n;
int d[550];
long long m[550][550];
int main()
{
fin>>n;
for(int i=0;i<=n;i++)
fin>>d[i];
for(int i=0;i<n;i++)
m[i][i+1]=d[i]*d[i+1]*d[i+2];
for(int i=n;i>=0;i--)
for(int k=2;i+k<=n;k++)
{
long long minn = LONG_LONG_MAX;
for(int j=0;j<k;j++)
minn = std::min(minn, m[i][i+j]+m[i+j+1][i+k]+d[i]*d[i+j+1]*d[i+k]);
m[i][i+k]=minn;
}
fout<<m[0][n];
}
