Pagini recente » Cod sursa (job #1457697) | Cod sursa (job #1714338) | Cod sursa (job #1617267) | Cod sursa (job #3277441) | Cod sursa (job #2637355)
#include <fstream>
#include <climits>
const int NMAX = 500;
long long int dp[1+NMAX][1+NMAX];
int v[2+NMAX];
using namespace std;
int main()
{
ifstream f("podm.in");
ofstream g("podm.out");
int n;
f>>n;
for(int i=1;i<=n+1;i++)
{
f>>v[i];
}
for(int l=2;l<=n;l++)
{
for(int i=1;i<=n;i++)
{
dp[l][i]=LLONG_MAX;
}
}
for(int l=2;l<=n;l++)
{
for(int i=1;i<=n-l+1;i++)
{
dp[l][i] = min(dp[l-1][i] + v[i]*v[i+l]*v[i+l-1],
dp[l-1][i+1] + v[i]*v[i+l]*v[i+1]);
}
}
g<<dp[n][1];
return 0;
}