Pagini recente » Cod sursa (job #1037004) | Cod sursa (job #2444224) | Cod sursa (job #415113) | Cod sursa (job #2791843) | Cod sursa (job #1551928)
# include <bits/stdc++.h>
using namespace std;
ifstream fi("podm.in");
ofstream fo("podm.out");
long long dp[555][555];
int s[5005];
int main(void)
{
int n;
fi>>n;
for (int i = 1;i <= n + 1;++i) fi>>s[i];
for (int i = 1;i <= n;++i)
for (int j = i+1;j <= n;++j) dp[i][j] = 1e16;
for (int len = 1;len <= n - 1;++len)
for (int i = 1;i+len <= n;++i)
for (int k = i;k <= i+len-1;++k)
dp[i][i+len] = min(dp[i][i+len],dp[i][k] + dp[k+1][i+len] + 1ll * s[i] * s[k+1] * s[i+len+1]);
return fo << dp[1][n] << '\n',0;
}