Pagini recente » Cod sursa (job #871445) | Cod sursa (job #1632250) | Cod sursa (job #565952) | Cod sursa (job #2931278) | Cod sursa (job #1527572)
#include <cstdio>
#include <algorithm>
#define DIM 512
#define INF 10000000000000000LL
using namespace std;
int V[DIM], N;
long long D[DIM][DIM];
int main ()
{
freopen ("podm.in" ,"r", stdin );
freopen ("podm.out","w", stdout);
scanf ("%d", &N); N ++;
for (int i = 1; i <= N; i ++)
scanf ("%d", &V[i]);
for (int i = 1; i <= N; i ++)
for (int j = i + 2; j <= N; j ++)
D[i][j] = INF;
for (int p = 1; p <= N; p ++)
for (int i = 1, j = i + p - 1; j <= N; i ++, j ++)
for (int k = i + 1; k < j; k ++)
D[i][j] = min (D[i][j], D[i][k] + D[k][j] + V[i] * 1LL * V[k] * V[j]);
printf ("%lld\n", D[1][N]);
fclose (stdin );
fclose (stdout);
return 0;
}