Pagini recente » Cod sursa (job #1008588) | Cod sursa (job #2664433) | Cod sursa (job #1759073) | Cod sursa (job #1586777) | Cod sursa (job #2278683)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long C[510][510],D[510],n;
long long solve(long long i,long long j)
{
long long k,x;
x=10000000000000;
if(i==j)
return 0;
else
{
if(C[i][j]!=0)
return C[i][j];
else
{
for(k=i;k<j;k++)
{
x=min(x,solve(i,k)+solve(k+1,j)+D[i]*D[k+1]*D[j+1]);
}
C[i][j]=x;
return x;
}
}
}
int main()
{
long long i,rez;
fin>>n;
for(i=1; i<=n+1; i++)
{
fin>>D[i];
}
rez=solve(1,n);
fout<<rez;
}