## Classic matrix problem

**Moderator:** Board moderators

### Classic matrix problem

Find a rectanglular submatrix of a matrix with maximum sum of its elements. What is an optimal solution for this.

For the maximal sum problem the best algorithm I know about is very complicated. It is better than the O(n^3) but is slower than O(n^3 / log n) so it doesn't really help.