Pagini recente » Cod sursa (job #1852547) | Cod sursa (job #863992) | Cod sursa (job #580755) | Cod sursa (job #123202) | Cod sursa (job #1929903)
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
unsigned long long d[502],n,i,m[502][502],j,k;
int main()
{
fin>>n;
for(i=0;i<=n;i++)
fin>>d[i];
for(i=1;i<n;i++)
m[i][i+1]=d[i-1]*d[i]*d[i+1];
for(j=2;j<n;j++)
{
for(i=1;i<=n&&i+j<=n;i++)
{
m[i][i+j]=100000000000000000LL;
for(k=i;k<i+j;k++)
{
m[i][i+j]=min(m[i][i+j],m[i][k]+m[k+1][i+j]+ d[i-1]*d[k]*d[i+j]);
}
}
}
fout<<m[1][n];
return 0;
}