Pagini recente » Cod sursa (job #253489) | Cod sursa (job #3252382) | Cod sursa (job #1944042) | Cod sursa (job #117835) | Cod sursa (job #1791268)
#include <iostream>
#include <cstdio>
#define infinit 0x3f3f3f3f
using namespace std;
int m[524][524], d[524], n;
int main()
{
freopen("podm.in", "r", stdin );
freopen("podm.out", "w", stdout);
scanf("%d", &n);
for(int i = 0; i <= n; i++)
scanf("%d", &d[i]);
for(int i = 1; i <= n; i++)
for(int j = i + 1; j <= n; j++)
m[i][j] = infinit;
for(int l = 1; l < n; l++)
for(int i = 1, j = l + 1; i <= n - 1 && j <= n; i++, j++)
for(int k = i; k < j; k++)
m[i][j] = min(m[i][k] + m[k + 1][j] + d[i - 1] * d[k] * d[j], m[i][j]);
printf("%d", m[1][n]);
return 0;
}