Pagini recente » Cod sursa (job #288333) | Cod sursa (job #2881073) | Cod sursa (job #1121992) | Cod sursa (job #2658468) | Cod sursa (job #2545194)
#include <fstream>
using namespace std;
const long long int inf=1LL<<61;
long long int n,v[505];
long long int optim[505][505];
int main()
{
ifstream fin ("podm.in");
ofstream fout("podm.out");
fin>>n;
n++;
for (int i=1;i<=n;i++)
fin>>v[i];
for (int pas=3;pas<=n;pas++)
for (int i=1;i+pas-1<=n;i++)
{
int j=i+pas-1;
optim[i][j]=inf;
for (int k=i+1;k<j;k++)
optim[i][j]=min(optim[i][j],optim[i][k]+optim[k][j]+v[i]*v[k]*v[j]);
}
fout<<optim[1][n];
fin.close();
fout.close();
return 0;
}