Pagini recente » Cod sursa (job #2209039) | Cod sursa (job #1743762) | Cod sursa (job #2203775) | Cod sursa (job #1366839) | Cod sursa (job #3342133)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
long long int n,d[505],dp[505][505]={0},diag=1;
int main()
{
fin>>n;
for(int i=0;i<=n;i++)
{
fin>>d[i];
}
for(int i=1,j=2;diag!=n;i++,j++)
{
dp[i][j]=dp[i][i]+dp[i+1][j]+d[i-1]*d[i]*d[j];
for(int k=i+1;k<j;k++)
dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+d[i-1]*d[k]*d[j]);
if(j==n)
{
i=0;
diag++;
j=diag;
}
}
fout<<dp[1][n];
return 0;
}