Pagini recente » Cod sursa (job #1114308) | Cod sursa (job #69319) | Cod sursa (job #134669) | Cod sursa (job #1151810) | Cod sursa (job #2958060)
#include <bits/stdc++.h>
#define int long long
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
int n;
signed main()
{
in >> n;
vector <int> v(n + 1);
for(int &x:v)
in >> x;
vector <vector<int>> dp(n + 1, vector <int>(n + 1));
for(int i = 1; i <= n; i++)
{
dp[i][i] = 0;
}
for(int len = 2; len <= n; len++)
{
for(int i = 1, j = len; j <= n; i++, j++)
{
dp[i][j] = 1e18;
for(int taietura = i; taietura < j; taietura++)
{
dp[i][j] = min(dp[i][j], dp[i][taietura] + dp[taietura + 1][j] + v[i - 1] * v[taietura] * v[j]);
}
}
}
out << dp[1][n];
return 0;
}