Nu exista pagina, dar poti sa o creezi ...
Cod sursa(job #2476284)
Utilizator | Data | 18 octombrie 2019 16:43:01 | |
---|---|---|---|
Problema | Parantezare optima de matrici | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
int n,l[505],c[505],x[505][505];
int main()
{ in>>n;
in>>l[1];
for(int i=1;i<=n+1;i++)
{ in>>c[i];
l[i+1]=c[i];
}
for(int i=n-1;i>0;i--)
{ for(int j=i+1;j<=n;j++)
{ x[i][j]=1000000000;
for(int k=i;k<j;k++)
x[i][j]=min(x[i][j],x[i][k]+x[k+1][j]+l[i]*c[k]*c[j]);
}
}
out<<x[1][n];
in.close();
out.close();
return 0;
}