Pagini recente » Cod sursa (job #494224) | Cod sursa (job #1023455) | Cod sursa (job #1033119) | Cod sursa (job #402050) | Cod sursa (job #1094459)
#include <fstream>
#define DMAX 504
#define INF 1000000000000ll
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n;
long long int d[DMAX];
long long int nrmin[DMAX][DMAX];
void citire();
void pd();
void afisare();
int main()
{
citire();
pd();
afisare();
return 0;
}
void citire()
{
int i;
fin>>n;
for(i=0;i<=n;i++)
fin>>d[i];
}
void pd()
{
int i,j,x;
long long int k, minim, kmin;
//initializari
//diagonala principala
for(i=0;i<=n;i++)
nrmin[i][i]=0;
//doua matrici
for(i=1;i<n;i++)
nrmin[i][i+1]=d[i-1]*d[i]*d[i+1];
//recurenta pentru n matrici, x=3,n
for(x=3;x<=n;x++)
for(i=1;i<=n-x+1;i++)
{
//am x matrici incepand de la pozitia i
//i=inceputul, j=finalul
j=i+x-1;
minim=INF;
for(k=i;k<j;k++)
if(minim>nrmin[i][k]+nrmin[k+1][j]+d[i-1]*d[k]*d[j])
{
minim=nrmin[i][k]+nrmin[k+1][j]+d[i-1]*d[k]*d[j];
kmin=k;
}
nrmin[i][j]=minim;
nrmin[j][i]=kmin;
}
}
void afisare()
{
fout<<nrmin[1][n];
}