* @brief Finds the optimal sequence using the classic O(n^3) algorithm. * @param l length of cost array * @param p costs of each matrix * @param s location to store results * @returns number of operations */
source not stored for this graph (policy: none)