Pagini recente » Cod sursa (job #1119009) | Cod sursa (job #2564461) | Cod sursa (job #1863956) | Cod sursa (job #2329549) | Cod sursa (job #1722963)
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
unsigned long long m[505][505];
int d[501];
int main()
{
int n,i,dis,k;
unsigned long long sol;
fin>>n;
for(i=0;i<=n;i++)
fin>>d[i];
for(i=1;i<=n;i++)
m[i][i]=0;
for(i=1;i<=n-1;i++)
m[i][i+1]=d[i-1]*d[i]*d[i+1];
for(dis=2;dis<n;dis++)
{
for(i=1;i<=n-dis;i++)
{
sol=100000000000000000LL;
for(k=i;k<i+dis;k++)
{
sol=min(m[i][k]+m[k+1][i+dis]+(d[i-1]*d[k]*d[i+dis]),sol);
}
m[i][i+dis]=sol;
}
}
fout<<m[1][n];
return 0;
}