Pagini recente » Cod sursa (job #3294924) | Cod sursa (job #3121928) | Cod sursa (job #3291442) | Cod sursa (job #3292665) | Cod sursa (job #3295078)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define inf 1e13
ll dp[505][505], v[505], n;
ifstream fin("podm.in");
ofstream fout("podm.out");
int main()
{
fin >> n;
for (int i = 0; i <= n; ++i)
fin >> v[i];
for (int i = 1; i <= n; ++i)
dp[i][i] = 0;
for(int len = 2; len <= n; ++len)
{
for(int i = 1; i <= n - len + 1; ++i)
{
int j = i + len - 1;
dp[i][j] = inf;
for (int k = i; k < j; ++k)
{
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j] + v[i-1] * v[k] * v[j]);
}
}
}
fout << dp[1][n] << '\n';
return 0;
}