Pagini recente » Cod sursa (job #2309568) | Cod sursa (job #1867870) | Cod sursa (job #3300948)
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long dp[505][505];
int l[505];
int c[505];
int main()
{
int n;
fin >> n;
int prv;
fin >> prv;
for (int i = 1; i <= n; i++)
{
l[i] = prv;
fin >> prv;
c[i] = prv;
}
for (int st = n - 1; st >= 1; st--)
{
for (int dr = st + 1; dr <= n; dr++)
{
dp[st][dr] = 1e18;
for (int k = st; k < dr; k++)
{
long long inmultiri = 1LL * l[st] * c[dr] * c[k];
if (dp[st][dr] > dp[st][k] + dp[k + 1][dr] + inmultiri)
dp[st][dr] = dp[st][k] + dp[k + 1][dr] + inmultiri;
}
// fout<<dp[st][dr]<<" ";
}
}
fout << dp[1][n];
}