#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;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y2xpbWl0cz4KCmNvbnN0IGludCBuID0gMTA7CiAKdm9pZCBNYXRyaXhDaGFpbk9yZGVyKGludCBwW10sIGludCBsZW4sIGludCBtW11bbl0sIGludCBzW11bbl0pewogICAgICAgIGZvcihpbnQgaSA9IDA7IGkgPCBsZW4gLSAxOyBpKyspCiAgICAgICAgICAgICAgICBtW2ldW2ldID0gMDsKICAgICAgICBmb3IoaW50IGwgPSAxOyBsIDwgbGVuIC0gMTsgbCsrKQogICAgICAgICAgICAgICAgZm9yKGludCBpID0gMDsgaSA8IGxlbiAtIGwgKyAxOyBpKyspewogICAgICAgICAgICAgICAgICAgICAgICBpbnQgaiA9IGkgKyBsIC0gMTsKICAgICAgICAgICAgICAgICAgICAgICAgbVtpXVtqXSA9IElOVF9NQVg7CiAgICAgICAgICAgICAgICAgICAgICAgIGZvcihpbnQgayA9IGk7IGsgPCBqIC0gMTsgaysrKXsKICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICBpbnQgcSA9IG1baV1ba10gKyBtW2sgKyAxXVtqXSArIHBbaSAtIDFdICogcFtrXSAqIHBbal07CiAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgaWYocSA8IG1baV1bal0pewogICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgbVtpXVtqXSA9IHE7CiAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICBzW2ldW2pdID0gazsKICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICB9CiAgICAgICAgICAgICAgICAgICAgICAgIH0KICAgICAgICAgICAgICAgIH0KfQogCmludCBtYWluKCl7CiAgICAgICAgaW50IHBbbl0gPSB7MTAsIDUwLCAzMCwgNywgMjUsIDYwLCAxNSwgODAsIDU1LCAzMH07CiAgICAgICAgaW50IG1bbl1bbl07CiAgICAgICAgaW50IHNbbl1bbl07CiAKICAgICAgICBNYXRyaXhDaGFpbk9yZGVyKHAsIG4sIG0sIHMpOwogCiAgICAgICAgc3RkOjpjb3V0IDw8ICJTb2x1dGlvbiBmb3IgbSBhbmQgczogIiA8PCBzdGQ6OmVuZGw7CiAKfQ==