Pagini recente » Cod sursa (job #3146090) | Cod sursa (job #619005) | Profil adiaioana | Monitorul de evaluare | Cod sursa (job #2453018)
#include <bits/stdc++.h>
using namespace std;
ifstream in("podm.in");
ofstream out("podm.out");
const long long INF = 1LL << 62;
const int LMAX = 500;
int N;
short D[LMAX+1];
long long M[LMAX+1][LMAX+1];
void calc() {
for(int d = 1; d < N; d++)
for(int i = N - d - 1; i >= 0; i--) {
int j = i+d;
M[i][j] = INF;
for(int k = i; k < j; k++) {
long long t = M[i][k] + M[k+1][j] + (long long)D[i] * D[k+1] * D[j+1];
if(M[i][j] > t)
M[i][j] = t;
}
}
}
int main()
{
in >> N;
for(int i = 0; i <= N; i++)
in >> D[i];
calc();
out << M[0][N-1];
return 0;
}