Pagini recente » Cod sursa (job #825127) | Cod sursa (job #2586686) | Cod sursa (job #797903) | Cod sursa (job #2656928) | Cod sursa (job #2976601)
#include <fstream>
using namespace std;
const int N = 1000;
const long long INF = 1LL << 62;
int dim[N+2], n;
long long dp[N+1][N+1];
ifstream in("podm.in");
ofstream out("podm.out");
int main()
{
in >> n;
for(int i = 1; i <= n + 1; i++)
{
in >> dim[i];
}
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)
{
long long rez = dp[i][k] + dp[k+1][j] + (long long)dim[i] * dim[k+1] * dim[j+1];
if (rez < dp[i][j])
{
dp[i][j] = rez;
dp[j][i] = k;
}
}
}
}
out << dp[1][n] << '\n';
in.close();
out.close();
return 0;
}