Cod sursa(job #2297619)
Utilizator | Data | 6 decembrie 2018 09:46:36 | |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long n,i,j,x[1000],a[1000][1000],k,l;
int main()
{
fin>>n;
for(i=0;i<=n;++i)
fin>>x[i];
for(i=1;i<=n;++i)
a[i][i+1]=x[i-1]*x[i]*x[i+1];
for(j=2;j<=n-1;++j)
for(i=1;i<=n-j;++i)
{
k=i+j;
a[i][k]=100000000000000000LL;
for(l=i;l<=k-1;++l)
a[i][k]=min(a[i][k],a[i][l]+a[l+1][k]+x[i-1]*x[l]*x[k]);
}
fout<<a[1][n];
return 0;
}