Mai intai trebuie sa te autentifici.
Cod sursa(job #1028126)
| Utilizator | Data | 13 noiembrie 2013 17:56:14 | |
|---|---|---|---|
| Problema | Parantezare optima de matrici | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <fstream>
#define Min(a,b) ( (a) < (b) ? (a) : (b) )
#define Nmax 509
#define Inf 99999999999
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
int N,dim[Nmax];
long long Best[Nmax][Nmax];
int main()
{
f>>N;
for(int i=0;i<=N;++i)f>>dim[i];
for(int i=1;i<=N;++i)Best[i][i]=0;
for(int i=1;i<=N-1;++i)Best[i][i+1]=dim[i-1]*dim[i]*dim[i+1];
for(int d=2;d<=N-1;++d)
for(int i=1;i<=N-d;++i)
{
Best[i][i+d]=Inf;
for(int j=i;j<=i+d;++j)
Best[i][i+d]=Min(Best[i][i+d],Best[i][j]+Best[j+1][i+d]+dim[i-1]*dim[j]*dim[i+d]);
}
g<<Best[1][N]<<'\n';
f.close();g.close();
return 0;
}
