Pagini recente » Cod sursa (job #270582) | Cod sursa (job #2836982) | Cod sursa (job #734358) | Cod sursa (job #1421772) | Cod sursa (job #1676340)
#include <fstream>
#define nMax 501
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n;
int v[nMax];
long long dp[nMax][nMax];
void read()
{
fin>>n;
for(int i=0;i<=n;i++)
fin>>v[i];
}
void solve()
{
for(int len=2;len<=n;len++)
{
for(int i=1;i+len-1<=n;i++)
{
int j=i+len-1;
dp[i][j]=1ll<<62;
for(int k=i;k<j;k++)
dp[i][j]=min(dp[i][j], dp[i][k]+dp[k+1][j]+1LL*v[i-1]*v[k]*v[j]);
}
}
fout<<dp[1][n];
}
int main()
{
read();
solve();
return 0;
}