Pagini recente » Cod sursa (job #1024038) | Cod sursa (job #1092642) | Cod sursa (job #1633748) | Cod sursa (job #1569067) | Cod sursa (job #3295812)
#include <bits/stdc++.h>
using namespace std;
int v[505];
long long dp[505][505];
int a[505],b[505];
long long int x[505][505];
long long int y[505][505];
int main()
{
ifstream cin("podm.in");
ofstream cout("podm.out");
int n;
cin>>n;
for(int i=1;i<=n+1;++i)
{
cin>>v[i];
}
for(int i=2;i<=n;++i)
{
for(int j=i;j<=n;++j)
{
dp[j][i]=1e18;
}
}
for(int i=1;i<=n;++i)
{
x[i][1]=v[i];
y[i][1]=v[i+1];
}
for(int j=2;j<=n;++j)
{
for(int i=j;i<=n;++i)
{
int in=0;
for(int h=1+i-j;h<=i;++h)
{
++in;
if((dp[h][in]+dp[i][j-in]+x[h][in]*y[h][in]*x[i][j-in])<dp[i][j])
{
x[i][j]=x[h][in];
y[i][j]=y[i][j-in];
}
dp[i][j]=min(dp[i][j],dp[h][in]+dp[i][j-in]+x[h][in]*y[h][in]*y[i][j-in]);
}
}
}
cout<<dp[n][n];
return 0;
}