Pagini recente » Cod sursa (job #1813701) | Cod sursa (job #1704702) | Cod sursa (job #968322) | Cod sursa (job #628172) | Cod sursa (job #2813986)
#include <fstream>
#define INF 1000000000000000000
using namespace std;
ifstream fin("podm.in");
ofstream fout ("podm.out");
int n;
int i, j, k;
long long int sum;
int dif;
long long int d[502];
long long int pd[502][502];
int cuts[502][502];
int main()
{
fin>>n;
for (i=0; i<=n; i++)
fin>>d[i];
for (i=1; i<=n; i++) pd[i][i]=0;
for (i=1; i<=n; i++) { pd[i][i+1]=d[i-1]*d[i+1]*d[i]; cuts[i][i+1]=i;}
for (dif=2; dif<=n-1; dif++)
for (i=1; i<=n-dif; i++)
{j=i+dif;
pd[i][j]= INF;
for (k=i; k<=j; k++)
{
sum=pd[i][k]+pd[k+1][j]+d[i-1]*d[k]*d[j];
if (sum<pd[i][j])
{
pd[i][j]=sum;
cuts[i][j]=k;
}
}
}
fout<<pd[1][n];
return 0;
}