Cod sursa(job #1940915)
| Utilizator | Data | 26 martie 2017 21:16:20 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fi("podm.in");
ofstream fo("podm.out");
long long inf=1e18;//10^18
long long nr[503][503];
int lin,i,j,n,d[503];
int main()
{
fi>>n;
for(i=0;i<=n;i++) fi>>d[i];
for(lin=2;lin<=n;lin++)
for(i=1,j=lin; j<=n; i++,j++)
{
nr[i][j]=inf;
for(int k=i;k<j;k++)
nr[i][j]=min(nr[i][j],nr[i][k]+nr[k+1][j]+1LL*d[i-1]*d[k]*d[j]);
}
fo<<nr[1][n];
return 0;
}
