Pagini recente » Cod sursa (job #2162176) | Cod sursa (job #2664644) | Cod sursa (job #3292170) | Cod sursa (job #1739800) | Cod sursa (job #2256815)
#include <fstream>
#define NMAX 510
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n;
long long int d[NMAX];
long long int cmin[NMAX][NMAX];
void citire(){
int i;
fin>>n;
for(i=0;i<=n;i++) fin>>d[i];
}
void pd(){
int i, j, k, nr;
long long int minim;
//initializarea pt 2 matrice
for (i=1;i<n;i++)
cmin[i][i+1]=d[i-1]*d[i]*d[i+1];
for(nr=3;nr<=n;nr++){
//calculez costul pt toate secventele de nr matrice
for(i=1;i<=n-nr+1;i++)
{
j=i+nr-1;
minim=cmin[i+1][j]+d[i-1]*d[i]*d[j];
for(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];
}
}
}
}
void afisare(){
fout<<cmin[1][n]<<'\n';
}
int main()
{
citire();
pd();
afisare();
return 0;
}