Pagini recente » Cod sursa (job #1686478) | Cod sursa (job #68583) | Cod sursa (job #1340706) | Cod sursa (job #1805195) | Cod sursa (job #1585018)
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long n,d[505],dp[505][505],j,k,i;
int main()
{
fin>>n;
for(i=1;i<=n+1;i++) fin>>d[i];
for(i=1;i<n;i++)
dp[i][i+1]=d[i]*d[i+1]*d[i+2];
int xc, yc;
for(i=3;i<=n;i++)
{
xc=1; yc=i;
while(yc<=n)
{
dp[xc][yc]=999999999;
for(k=xc;k<=yc;k++)
dp[xc][yc]=min(dp[xc][yc], dp[xc][k]+dp[k+1][yc]+d[xc]*d[k+1]*d[yc+1]);
++xc; ++yc;
}
}
fout<<dp[1][n];
return 0;
}