Pagini recente » Cod sursa (job #1133490) | Cod sursa (job #1861291) | Cod sursa (job #280071) | Cod sursa (job #1718156) | Cod sursa (job #2275938)
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long d[505],sol[505][505],n,minim;
int main()
{
int i;
fin>>n;
for(i=1;i<=n+1;i++)
{
fin>>d[i-1];
}
for(i=1;i<=n;i++)
{
sol[i][i]=0;
}
for(i=1;i<n;i++)
{
sol[i][i+1]=d[i-1]*d[i]*d[i+1];
}
for(int j=2;j<n;j++)
{
for(i=1;i<=n-j;i++)
{
minim=2000000;
for(int k=i;k<=i+j-1;k++)
{
if(sol[i][k]+sol[k+1][i+j]+d[i-1]*d[k]*d[i+j]<minim)
minim=sol[i][k]+sol[k+1][i+j]+d[i-1]*d[k]*d[i+j];
}
sol[i][i+j]=minim;
}
}
fout<<sol[1][n]<<'\n';
return 0;
}