Pagini recente » Cod sursa (job #1354588) | Cod sursa (job #1045551) | Cod sursa (job #1527581) | Cod sursa (job #2344277) | Cod sursa (job #1347698)
#include <fstream>
#define DMAX 1000
#define INF 2000000000
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n;
int d[DMAX];
int nrmin[DMAX][DMAX];
void citire();
void rezolvare();
void afisare();
int main()
{
citire();
rezolvare();
afisare();
return 0;
}
void afisare()
{
fout<<nrmin[1][n]<<'\n';
}
void rezolvare()
{
int i,j,k,lg,minim,kmin;
for (i=1;i<n;i++) nrmin[i][i+1]=d[i-1]*d[i]*d[i+1];
for (lg=3;lg<=n;lg++)
for (i=1;i<=n-lg+1;i++)
{
j=i+lg-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 citire()
{
int i;
fin>>n;
for (i=0;i<=n;i++) fin>>d[i];
}