Pagini recente » Cod sursa (job #2224236) | Cod sursa (job #2700728) | Cod sursa (job #273448) | Cod sursa (job #2583909) | Cod sursa (job #2104348)
#include <fstream>
using namespace std;
ifstream fin("podm.in");
ofstream fout("podm.out");
#define MAXN 505
#define Min(a, b) ((a) < (b) ? (a) : (b))
int n;
long long d[MAXN], bst[MAXN][MAXN];
int main(void)
{
fin >> n;
for (int i = 0; i <= n; i++)
fin >> d[i];
for (int i = 1; i <= n; i++)
bst[i][i] = 0;
for (int i = 1; i < n; i++)
bst[i][i + 1] = d[i - 1] * d[i] * d[i + 1];
for (int w = 2; w < n; w++) {
for (int i = 1; i <= n - w; i++) {
int j = i + w;
bst[i][j] = 11111;
for (int k = i; k < j; k++)
bst[i][j] = Min(bst[i][j], bst[i][k] + bst[k + 1][j] + d[i - 1] * d[k] * d[j]);
}
}
fout << bst[1][n];
return 0;
}