Pagini recente » Cod sursa (job #2917635) | Cod sursa (job #456151) | Cod sursa (job #3213900) | Cod sursa (job #2192655) | Cod sursa (job #1830858)
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int d[505][505],a[505];
int main()
{
int n;
fin>>n;
for(int i=1;i<=n+1;i++)
fin>>a[i];
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
d[i][j]=(1<<30);
for(int i=1;i<n;i++)
d[i][i+1]=a[i+1]*a[i]*a[i+2];
for(int i=2;i<n;i++)
{
for(int j=1;i+j<=n;j++)
d[j][i+j]=min(d[j][i+j-1]+a[j]*a[j+i]*a[j+i+1],d[j+1][i+j]+a[j]*a[j+1]*a[j+i+1]);
}
fout<<d[1][n];
return 0;
}