Pagini recente » Cod sursa (job #174050) | Cod sursa (job #1964289) | Cod sursa (job #925773) | Cod sursa (job #1793504) | Cod sursa (job #3251553)
#include <bits/stdc++.h>
#define int unsigned long long
using namespace std;
int n;
vector<vector<int>> dp(505, vector<int>(505, LONG_LONG_MAX));
int d[505];
signed main()
{
ifstream cin("podm.in");
ofstream cout("podm.out");
cin >> n;
for (int i = 0; i <= n; ++i)
{
cin >> d[i];
}
for (int i = 1; i <= n; ++i)
{
dp[i][i] = 0;
if (i > 1)
dp[i][i + 1] = d[i - 1] * d[i] * d[i + 1];
}
for (int len = 2; len <= n; ++len)
for (int i = 1; i + len - 1 <= n; ++i)
{
int j = i + len - 1;
for (int k = i; k < j; ++k)
{
// cout << dp[i][j] << ' ';
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + d[i - 1] * d[k] * d[j]);
}
}
cout << dp[1][n];
return 0;
}