Pagini recente » Cod sursa (job #751918) | Cod sursa (job #2029557) | Cod sursa (job #954874) | Cod sursa (job #2264718) | Cod sursa (job #1315929)
#include<fstream>
using namespace std;
ifstream cin("podm.in");
ofstream cout("podm.out");
long long d[502][502],a[502];
int n,i,l,j,k;
int main()
{
cin>>n;
for(i=0;i<=n;i++)
cin>>a[i];
for(l=2;l<=n;l++)
for(i=1;i<=n-l+1;i++)
{
j=i+l-1;
d[i][j]=1ll<<62;
for(k=i;k<j;k++)
d[i][j]=min(d[i][j],d[i][k]+d[k+1][j]+a[i-1]*a[k]*a[j]);
}
cout<<d[1][n];
return 0;
}