Compute the integral matrix, find the min and max in that matrix (given that min is left and up from the max) and those would be the top left and bottom right of the max sum matrix.
mmm, I think that works.... On Jan 15, 7:25 pm, Ashish Goel <ashg...@gmail.com> wrote: > given a m*n matrix, find the subset rectangle with max sum (any other > rectangle taken would have lesser sum) > Best Regards > Ashish Goel > "Think positive and find fuel in failure" > +919985813081 > +919966006652 -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
