MCM, C++ (gcc) - rextester

Language: Layout:

// C++ program to print optimal parenthesization
// in matrix chain multiplication.
#include <bits/stdc++.h>
using namespace std;

// Function for printing the optimal
// parenthesization of a matrix chain product
void printParenthesis(int i, int j, int n, int* bracket,
					char& name)
{
	// If only one matrix left in current segment
	if (i == j) {
		cout << name++;
		return;
	}

cout << "(";

// Recursively put brackets around subexpression
	// from i to bracket[i][j].
	// Note that "*((bracket+i*n)+j)" is similar to
	// bracket[i][j]
	printParenthesis(i, *((bracket + i * n) + j), n,
					bracket, name);

// Recursively put brackets around subexpression
	// from bracket[i][j] + 1 to j.
	printParenthesis(*((bracket + i * n) + j) + 1, j, n,
					bracket, name);
	cout << ")";
}

// Matrix Ai has dimension p[i-1] x p[i] for i = 1..n
// Please refer below article for details of this
// function
// https://goo.gl/k6EYKj
void matrixChainOrder(int p[], int n)
{
	/* For simplicity of the program, one extra
	row and one extra column are allocated in
		m[][]. 0th row and 0th column of m[][]
		are not used */
	int m[n][n];

// bracket[i][j] stores optimal break point in
	// subexpression from i to j.
	int bracket[n][n];

/* m[i,j] = Minimum number of scalar multiplications
	needed to compute the matrix A[i]A[i+1]...A[j] =
	A[i..j] where dimension of A[i] is p[i-1] x p[i] */

// cost is zero when multiplying one matrix.
	for (int i = 1; i < n; i++)
		m[i][i] = 0;

// L is chain length.
	for (int L = 2; L < n; L++)
	{
		for (int i = 1; i < n - L + 1; i++) 
		{
			int j = i + L - 1;
			m[i][j] = INT_MAX;
			for (int k = i; k <= j - 1; k++) 
			{
				// q = cost/scalar multiplications
				int q = m[i][k] + m[k + 1][j]
						+ p[i - 1] * p[k] * p[j];
				if (q < m[i][j]) 
				{
					m[i][j] = q;

// Each entry bracket[i,j]=k shows
					// where to split the product arr
					// i,i+1....j for the minimum cost.
					bracket[i][j] = k;
				}
			}
		}
	}

// The first matrix is printed as 'A', next as 'B',
	// and so on
	char name = 'A';

cout << "Optimal Parenthesization is : ";
	printParenthesis(1, n - 1, n, (int*)bracket, name);
	cout << "nOptimal Cost is : " << m[1][n - 1];
  for(int i=1; i<n; i++)
  {
    cout<<"\n";
    for(int j=1; j<n; j++)
    {
      if(j<i)
        cout<<0<<"\t";
      else
      	cout<<m[i][j]<<"\t";
    }
    cout<<"\n";
  }
  cout<<"BRACKETS:\n";
  for(int i=1; i<n; i++)
  {
    cout<<"\n";
    for(int j=1; j<n; j++)
    {
      if(j<i)
        cout<<0<<"\t";
      else
      	cout<<bracket[i][j]<<"\t";
    }
    cout<<"\n";
  }
}

// Driver code
int main()
{
	int arr[] = { 5, 10, 20, 5, 100 };
	int n = sizeof(arr) / sizeof(arr[0]);
	matrixChainOrder(arr, n);
	return 0;
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 1.52 sec, absolute running time: 0.16 sec, cpu time: 0.01 sec, memory peak: 5 Mb, absolute service time: 1,77 sec