Pagini recente » Cod sursa (job #1197278) | Cod sursa (job #48121) | Cod sursa (job #605944) | Cod sursa (job #46759) | Cod sursa (job #1022534)
#include <iostream>
#include <cstdio>
using namespace std;
long long n,d[510];
long long cost[510][510];
void citire()
{
scanf("%lld",&n);
for (long long i=0; i<=n; i++)
scanf("%lld",&d[i]);
}
void parantezare()
{
for (long long l=1; l<n; l++)
for (long long i=1; i<=n-l; i++)
{
long long j=l+i;
cost[i][j]=((long long)1<<62);
for (long long k=i; k<j; k++)
cost[i][j]=min(cost[i][j], cost[i][k]+cost[k+1][j]+d[i-1]*d[k]*d[j]);
}
printf("%lld",cost[1][n]);
}
void afisare()
{
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
printf("%lld ",cost[i][j]);
printf("\n");
}
}
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
citire();
parantezare();
///afisare();
return 0;
}