Pagini recente » Cod sursa (job #2408845) | Cod sursa (job #748745) | Cod sursa (job #2829946) | Cod sursa (job #151237) | Cod sursa (job #1260688)
#include <fstream>
#include <algorithm>
#include <cstring>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n;
long long M[505][505],v[505];
void citire()
{
fin>>n;
for(int i=0 ; i<=n; i++)
fin>>v[i];
}
void PD()
{
for(int d = 1; d < n; d++)
for(int i=1; i<= n-d; i++)
{
int j = i + d;
M[i][j]=999999999999999999999999999999999999999999999999999;
for(int k = i ; k < j; k++)
M[i][j] = min(M[i][j],M[i][k]+M[k+1][j]+v[i-1]*v[k]*v[j]);
}
}
int main()
{
citire();
PD();
fout<<M[1][n]<<"\n";
return 0;
}