Pagini recente » Cod sursa (job #2350466) | Cod sursa (job #2648019) | Cod sursa (job #943032) | Cod sursa (job #1539253) | Cod sursa (job #1639591)
#include <fstream>
#include <cmath>
using namespace std;
int n,i,l,j,k;
long long m[505][505],d[505];
int main()
{
ifstream f("podm.in");
ofstream g("podm.out");
f>>n;
for(i=0;i<=n;++i)
f>>d[i];
for(l=2;l<=n;++l)
{
for(i=1;i<=n-l+1;++i)
{
j=i+l-1;
m[i][j]=INFINITY;
for(k=i;k<=j-1;++k)
{
long long aux=m[i][k]+m[k+1][j]+1ll*d[i-1]*d[k]*d[j];
if(aux < m[i][j]) m[i][j]=aux;
}
}
}
g<<m[1][n]<<"\n";
return 0;
}