Pagini recente » Cod sursa (job #2142945) | Cod sursa (job #2009456) | Cod sursa (job #355952) | Cod sursa (job #367987) | Cod sursa (job #771846)
Cod sursa(job #771846)
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 505;
const int INF = 0x3f3f3f3f;
int n;
int d[N][N];
int v[N];
void init(int n)
{
memset(d, INF, sizeof(d));
for (int i = 1; i <= n; ++i)
d[i][i] = 0;
}
int main()
{
freopen ("podm.in", "r", stdin);
freopen ("podm.out", "w", stdout);
scanf("%d", &n);
for (int i = 1; i <= n + 1; ++i) {
scanf("%d", &v[i]);
}
init(n);
for (int D = 1; D < n; ++D)
for (int i = 1; i + D <= n; ++i) {
int j = i + D;
for (int k = i; k < j; ++k) {
d[i][j] = min(d[i][j], d[i][k] + d[k + 1][j] + v[i] * v[k + 1] * v[j + 1]);
}
}
printf("%d", d[1][n]);
return 0;
}