#include <iostream>
#include <climits>

const int n = 10;
 
void MatrixChainOrder(int p[], int len, int m[][n], int s[][n]){
        for(int i = 0; i < len - 1; i++)
                m[i][i] = 0;
        for(int l = 1; l < len - 1; l++)
                for(int i = 0; i < len - l + 1; i++){
                        int j = i + l - 1;
                        m[i][j] = INT_MAX;
                        for(int k = i; k < j - 1; k++){
                                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;
                                        s[i][j] = k;
                                }
                        }
                }
}
 
int main(){
        int p[n] = {10, 50, 30, 7, 25, 60, 15, 80, 55, 30};
        int m[n][n];
        int s[n][n];
 
        MatrixChainOrder(p, n, m, s);
 
        std::cout << "Solution for m and s: " << std::endl;
 
}