Pagini recente » Cod sursa (job #1898679) | Cod sursa (job #2167) | Cod sursa (job #2212987) | Cod sursa (job #1574735) | Cod sursa (job #2419163)
#include <bits/stdc++.h>
#define nmax 510
#define lld long long
#define inf 999999999999999LL
using namespace std;
int n, a[nmax];
lld ans, dp[nmax][nmax];
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
scanf("%d",&n);
for (int i=1; i<=n+1; ++i)
scanf("%d",&a[i]);
for (int i=1; i<=n; ++i)
for (int j=i; j<=n; ++j)
dp[i][j] = inf;
for (int i=1; i<=n; ++i)
dp[i][i+1] = a[i]*a[i+1]*a[i+2], dp[i][i] = 0;
for (int j=3; j<=n; ++j)
{
int c = j;
int l = 1;
while (c<=n)
{
for (int k=l; k<c; ++k)
dp[l][c] = min(dp[l][c], dp[l][k]+dp[k+1][c]+a[l]*a[k+1]*a[c+1]);
++l;
++c;
}
}
ans = dp[1][n];
printf("%lld\n",ans);
fclose(stdin);
fclose(stdout);
return 0;
}