Pagini recente » Cod sursa (job #785383) | Cod sursa (job #266092) | Cod sursa (job #3213410) | Cod sursa (job #567383) | Cod sursa (job #2785560)
#include <bits/stdc++.h>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
int v[501];
long long dp[501][501];
int main()
{
int n,i,j,k;
in>>n;
for(i=1; i<=n+1; i++)
in>>v[i];
for(i=n;i>=1;i--)
for(j=i+1; j<=n; j++)
{
int k0=i;
for(k=i+1; k<j; k++)
if(dp[i][k]+dp[k+1][j]+1LL*v[i]*v[j+1]*v[k+1]<dp[i][k0]+dp[k0+1][j]+1LL*v[i]*v[j+1]*v[k0+1])
k0=k;
dp[i][j]=dp[i][k0]+dp[k0+1][j]+1LL*v[i]*v[j+1]*v[k0+1];
dp[j][i]=k0;
}
out<<dp[1][n]<<'\n';
return 0;
}