To find Maximum Sum SubMatrix Problem

I have开发者_StackOverflow社区 some queries in this problem, so posting it here... I have gone through various solutions available on stackoverflow and other website, but i am still not able to figure out the logic to calculate the same..

If any one can pull-out an example set for the same.. not program, example..... then that could help me in a big way.

URL: http://www.algorithmist.com/index.php/UVa_108

Also, how does maximum subarray problem fit in this solution.. what if all the numbers are negative. in that case what is the result of sum of maximum subarray problem(0 - certainly not)..

Please explain it.. It is a very important question that i am dealing with it right now, and just not able to figure out the example set... After this only, i can design a program..

Thanks.

If all the numbers are negative, then the maximum submatrix is the 1×1 submatrix containing the largest ("least negative") number.