Pagini recente » Cod sursa (job #924109) | Cod sursa (job #2778908) | Cod sursa (job #2527453) | Cod sursa (job #3203297) | Cod sursa (job #3268584)
#include <fstream>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
int n;
long long d[501], dp[501][501];
int main()
{
f >> n;
for(int i = 0; i <= n; i++)
f >> d[i];
for(int len = 2; len <= n; len++)
for(int i = 1, j = len; j <= n; i++, j++)
{
dp[i][j] = 1e18;
for(int k = i; k < j; k++)
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j] + d[i-1]*d[k]*d[j]);
}
g << dp[1][n];
f.close();
g.close();
return 0;
}