Pagini recente » Cod sursa (job #1804369) | Cod sursa (job #3000547) | Cod sursa (job #3138997) | Cod sursa (job #1505382) | Cod sursa (job #2497897)
#include <fstream>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
const int MAX = 501;
const long long INF = (1ll << 60);
long long n, a[MAX], dp[MAX][MAX];
int main()
{
in>>n;
for(int i=1; i<=n+1; i++)
in>>a[i];
for(int i=n; 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][k] + dp[k+1][j] + a[i] * a[k+1] * a[j+1], dp[i][j]);
}
}
}
out<<dp[1][n]<<'\n';
return 0;
}