Pagini recente » Cod sursa (job #177294) | Cod sursa (job #1908869) | Cod sursa (job #2028067) | Cod sursa (job #1446441) | Cod sursa (job #2407735)
#include <fstream>
using namespace std;
ifstream fin ("podm.in");
ofstream fout ("podm.out");
const int Dim = 501;
long long M[Dim][Dim],n,D[Dim];
int main() {
fin >> n;
++n;;
for ( int i = 1; i <= n+1; ++i) {
fin >> D[i];
}
for ( int i = 1; i <= n; ++i)
for ( int j= 2+i; j <= n; ++j)
M[i][j] = 1LL << 58;
M[1][1] = 1;
for ( int l = 3; l <= n; ++l)
for ( int i = 1; i <= n-l+1; ++i) {
int j = i + l - 1;
for ( int k = i + 1; k < j; ++k)
M[i][j] = min(M[i][j],M[i][k] + M[k][j] + D[i] *D[k] * D[j]);
}
fout << M[1][n];
}