Pagini recente » Cod sursa (job #2548469) | Cod sursa (job #2007300) | Cod sursa (job #2866503) | Cod sursa (job #2930614) | Cod sursa (job #2457040)
#include <iostream>
#include <fstream>
#define INFINIT 100000000000000000LL
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
int n;
unsigned long long dp[505][505];
long long s[505];
int main()
{
in>>n;
for(int i=0;i<=n;++i)
in>>s[i];
for(int i=1;i<n;++i)
dp[i][i+1]=s[i-1]*s[i]*s[i+1];
for(int lungime=2;lungime<n;++lungime){
for(int i=1;i<=n-lungime;++i){
int j=i+lungime;
dp[i][j]=INFINIT;
for(int k=i;k<j;++k)
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+s[i-1]*s[k]*s[j]);
}
}
out<<dp[1][n];
return 0;
}