Pagini recente » Cod sursa (job #1039011) | Cod sursa (job #934967) | Cod sursa (job #2503572) | Cod sursa (job #2529583) | Cod sursa (job #2256813)
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n;
long long int d[510];
long long int cmin[510][510],minim;
void citire()
{
fin>>n;
for(int i=0; i<=n; ++i) fin>>d[i];
}
void pd()
{
// initializare pt 2 matrice
for(int i=1; i<n; ++i)
{
cmin[i][i+1]=d[i-1]*d[i]*d[i+1];
for(int nr=3; nr<=n; ++nr)
{
//calculez costul pt toate secventele pt n matrice
for(int i=1;i<=n-nr+1;i++){
int j=i+nr-1;
minim=cmin[i+1][j]+d[i-1]*d[i]*d[j];
for(int k=i+1;k<j;++k){
if(minim>cmin[i][k]+cmin[k+1][j]+d[i-1]*d[k]*d[j]){
minim=cmin[i][k]+cmin[k+1][j]+d[i-1]*d[k]*d[j];
}
cmin[i][j]=minim;
}
}
}
}
}
void afisare(){
fout<<cmin[1][n]<<'\n';
}
int main()
{
citire();
pd();
afisare();
return 0;
}