Pagini recente » Cod sursa (job #1273626) | Cod sursa (job #1759011) | Cod sursa (job #2166488) | Cod sursa (job #480291) | Cod sursa (job #3266455)
#include <fstream>
#include <vector>
using namespace std;
const long long INF = 1LL << 60;
int main()
{
ifstream in("podm.in");
ofstream out("podm.out");
int n;
in >> n;
vector <int> nr(n + 2);
for (int i = 1; i <= n + 1; i++)
{
in >> nr[i];
}
vector < vector <long long>> dp(n + 1);
for (int i = 1; i <= n; i++)
{
vector <long long> aux (n + 1, 0);
dp[i] = aux;
}
for (int i = n - 1; i >= 1; i--)
{
for (int j = i + 1; j <= n; j++)
{
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] + (long long)nr[i] * nr[k+1] * nr[j+1]);
}
}
}
out << dp[1][n] << "\n";
in.close();
out.close();
return 0;
}