Pagini recente » Cod sursa (job #3179665) | Cod sursa (job #1002712) | Cod sursa (job #2935445) | Cod sursa (job #1505622) | Cod sursa (job #2232431)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long n,i,j,k,nr,l,M[505][505];
int d[505];
int main () {
fin>>n;
for(i=1;i<=n+1;i++)
fin>>d[i];
for(k=2;k<=n;k++)
for(i=1;i<=n-k+1;i++)
{
l=i+k-1;
M[i][l]=M[i][i]+M[i+1][l]+d[i]*d[i+1]*d[l+1];
for(j=i+1;j<l;j++)
{
nr=M[i][j]+M[j+1][l]+d[i]*d[j+1]*d[l+1];
if(nr<M[i][l])
M[i][l]=nr;
}
}
fout<<M[1][n]<<"\n";
}