Pagini recente » Cod sursa (job #1605918) | Cod sursa (job #1365570) | Cod sursa (job #1908848) | Cod sursa (job #1652025) | Cod sursa (job #2260906)
#include <iostream>
#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];
long long int minim;
void citire();
void afisare();
void pd();
int main()
{
citire();
pd();
afisare();
return 0;
}
void citire()
{
fin>>n;
for(int i =0 ; i<=n;i++)
{
fin>>d[i];
}
}
void pd()
{
//initializre pentru 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 pentru toate secventele de nr 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;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';
}