Pagini recente » Cod sursa (job #1282087) | Cod sursa (job #1464046) | Cod sursa (job #3001574) | Cod sursa (job #2745331) | Cod sursa (job #1791325)
#include <cstdio>
#include <climits>
using namespace std;
const long long inf= LLONG_MAX;
long long n, d[505], M[505][505];
void citire()
{
scanf("%lld", &n);
for(long long i=0; i<=n; i++)
scanf("%lld", &d[i]);
}
void dinamic()
{
for(long long y=1; y<n; y++)
{
long long i=1;
long long j=y+1;
while(j<=n)
{
long long mini= inf;
for(long long k=i; k<j; k++)
{
long long tmp=M[i][k]+M[k+1][j]+d[i-1]*d[k]*d[j];
if(tmp<mini)
mini=tmp;
}
M[i][j]=mini;
i++;
j++;
}
}
}
void afisare()
{
printf("%lld", M[1][n]);
}
int main()
{
freopen("podm.in", "r", stdin);
freopen("podm.out", "w", stdout);
citire();
dinamic();
afisare();
return 0;
}