Cod sursa(job #2544347)
Utilizator | Data | 11 februarie 2020 22:46:28 | |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long n,i,j,y,l,p,a[505],d[505][505];
int main()
{
fin >> n;
n++;
for (i=1;i<=n;i++) fin >> a[i];
for (l=3;l<=n;l++) for (i=1;i+l-1<=n;i++)
{
j=i+l-1;
d[i][j]=LLONG_MAX;
for (y=i+1;y<j;y++)
{
p=d[i][y]+d[y][j]+a[i]*a[y]*a[j];
d[i][j]=min(d[i][j],p);
}
}
fout << d[1][n];
return 0;
}