Challenge problem 3This is simply the two-dimensional version of problem 2. You are given an n-by-n matrix of numbers. What is the submatrix with the largest sum?For example, for the input
There is a O(n3) algorithm, where n is as in "n-by-n matrix". |