Pagini recente » Cod sursa (job #1230298) | Cod sursa (job #1013590) | Cod sursa (job #2872489) | Cod sursa (job #2483635) | Cod sursa (job #3155881)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
int n;
int v[505];
long long dp[505][505];
void read()
{
fin>>n;
for(int i=0;i<=n;i++)
{
fin>>v[i];
}
for(int i=1;i<n;i++)
dp[i][i+1]=1ll*v[i-1]*v[i]*v[i+1];
}
void solve()
{
for(int l=3;l<=n;l++)
{
for(int i=1;i<=n-l+1;i++)
{
int j=i+l-1;
dp[i][j]=1e18;
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;
}