Pagini recente » Cod sursa (job #1240) | Clasament dupa rating | Cod sursa (job #1761049) | Cod sursa (job #3288220) | Cod sursa (job #1463574)
#include <fstream>
using namespace std;
ofstream fout("podm.out");
ifstream fin("podm.in");
const int NMAX = 505, INF = 10000000000000000LL;
int n;
long long mat[NMAX][NMAX], d[NMAX];
int main()
{
fin >> n;
for(int i=0; i<=n; i++) fin >> d[i];
for(int i=1; i<=n; i++) mat[i][i] = 0;
for(int i=1; i<=n; i++)
for(int j=i+1; j<=n; j++)
mat[i][j] = INF;
for(int diagonala=1; diagonala<=n-1; diagonala++) {
for(int i=1; i<=n-diagonala; i++) {
int j = i + diagonala;
for(int k=i; k<=j-1; k++)
mat[i][j] = min(mat[i][j], d[i-1] * d[k] * d[j] + mat[i][k] + mat[k+1][j]);
}
}
fout << mat[1][n] << '\n';
return 0;
}