Pagini recente » Cod sursa (job #85886) | Cod sursa (job #2275719) | Cod sursa (job #1055319) | Cod sursa (job #2424705) | Cod sursa (job #1362520)
#include<cstdio>
#include<string>
using namespace std;
#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "podm";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif
const int INF = (1 << 30);
const int NMAX = 500 + 5;
int N;
int A[NMAX];
int DP[NMAX][NMAX];
int main() {
int i, j, k, d;
freopen(inputFile.c_str(), "r", stdin);
freopen(outputFile.c_str(), "w", stdout);
scanf("%d", &N);
for(i = 0; i <= N; i++)
scanf("%d", &A[i]);
for(i = 1; i <= N; i++)
DP[i][i + 1] = A[i - 1] * A[i] * A[i + 1];
for(d = 2; d <= N; d++)
for(i = 1, j = 1 + d; j <= N; i++, j++) {
DP[i][j] = INF;
for(k = i; k <= j; k++)
DP[i][j] = min(DP[i][j], DP[i][k] + DP[k + 1][j] + A[i - 1] * A[k] * A[j]);
}
printf("%d\n", DP[1][N]);
return 0;
}