Pagini recente » Cod sursa (job #1829020) | Cod sursa (job #88009) | Cod sursa (job #2009961) | Cod sursa (job #2477635) | Cod sursa (job #1133901)
#include <fstream>
#define infinit 1000000000000000000ll
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n,k,kmin,i,j,lg;
long long int d[503], nrmin[503][503],minn;
int main()
{
fin>>n;
for (i=0;i<=n;i++)
fin>>d[i];
for (i=1;i<=n;i++)
nrmin[i][i]=0;
for (i=1;i<=n-1;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;
minn=infinit;
for (k=i;k<=j-1;k++)
{
if (minn>nrmin[i][k]+nrmin[k+1][j]+d[i-1]*d[k]*d[j])
{minn=nrmin[i][k]+nrmin[k+1][j]+d[i-1]*d[k]*d[j];
kmin=k;}
}
nrmin[i][j]=minn;
nrmin[j][i]=kmin;
}
fout<<nrmin[1][n]<<'\n';
return 0;
}