Pagini recente » Cod sursa (job #762403) | Cod sursa (job #776269) | Borderou de evaluare (job #1586095) | Cod sursa (job #2360608) | Cod sursa (job #447523)
Cod sursa(job #447523)
#include<cstdio>
#define INF 1000000000000000000LL
using namespace std;
long long n,i,j,q,s,k;
long long d[512],a[512][512];
void podm();
void write();
void initializare();
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
scanf("%lld",&n);
for(i=0;i<=n;++i)
{
scanf("%lld",&d[i]);
if (i>1)
a[i-1][i]= (long long) d[i-2]*d[i-1]*d[i];
}
for (q=2;q<=n;++q)
for (i=1;i+q-1<=n;++i)
{
j=i+q-1;
a[i][j]=INF;
for (k=i;k<j;++k)
if((s= a[i][k]+a[k+1][j]+d[i-1]*d[k]*d[j])<a[i][j])
a[i][j]=s;
}
printf("%lld\n",a[1][n]);
return 0;
}