Pagini recente » Cod sursa (job #504324) | Cod sursa (job #2490312) | Cod sursa (job #3245960) | Cod sursa (job #506921) | Cod sursa (job #1535061)
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int nmx = 502;
const int inf = 0x3f3f3f3f;
int n,D[nmx],dp[nmx][nmx];
int main() {
freopen("podm.in", "r", stdin);
freopen("podm.out", "w", stdout);
memset(dp,inf,sizeof(dp));
scanf("%d", &n);
for(int i = 0; i <= n; ++i)
scanf("%d", &D[i]);
for(int i = 1; i < n; ++i)
dp[i][i+1] = D[i-1]*D[i]*D[i+1];
for(int i = 1; i <= n; ++i)
dp[i][i] = 0;
for(int d = 2; d < n; ++d)
for(int i = 1; i <= n - d; ++i)
for(int k = i; k < i + d; ++k)
dp[i][i+d] = min(dp[i][i+d], dp[i][k] + dp[k+1][i+d] + D[i-1]*D[k]*D[i+d]);
printf("%d\n", dp[1][n]);
return 0;
}