Pagini recente » Cod sursa (job #1064650) | Cod sursa (job #1066406) | Cod sursa (job #1821126) | Cod sursa (job #1209492) | Cod sursa (job #2256800)
#include <bits/stdc++.h>
#define nmax 510
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long int n, d[nmax];
long long int cmin[nmax][nmax];
void citire();
void programare();
void afisare();
int main()
{
citire();
programare();
afisare();
return 0;
}
void citire()
{
int i;
fin >> n;
for(i=0;i<=n;i++)
fin >> d[i];
}
void programare()
{
int i,nr,j,minim,k;
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 pentru toate secv 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];
cmin[i][j]=minim;
}
}
}
}
void afisare()
{
fout << cmin[1][n] << '\n';
}