Pagini recente » Cod sursa (job #1827604) | Cod sursa (job #1613584) | Cod sursa (job #266014) | Cod sursa (job #2627791) | Cod sursa (job #795408)
Cod sursa(job #795408)
#include <cstdio>
using namespace std;
int n;
int d[10005];
long long mat[551][551];
void citire()
{
scanf("%d",&n);
for(int i = 0; i<n+1;i++)
{
scanf("%d",&d[i]);
}
}
void inmultire()
{
for(int i = 1 ; i < n;i++)
{
for(int j = 1; j <= n-i; j++)
{
int optimGlob;
long long min = mat[j][j] + mat[j+1][i+j] + d[j-1] * d[j] *d[j+i];
for(int k = j; k < j+i;k++)
{
long long z =mat[j][k]+mat[k+1][i+j]+d[j-1]*d[k]*d[j+i];
if(min > z)
{
min = z;
optimGlob = k;
}
}
mat[j][j+i] = min;
mat[j+i][j] = optimGlob;
}
}
}
int main()
{
freopen("podm.in","r",stdin);
freopen("podm.out","w",stdout);
citire();
inmultire();
printf("%lld",mat[1][n]);
return 0;
}