You can first solve the 1-dimension similar problem using DP. That's, find the maximum sum of continuous sub sequence of an array. Then you can apply this to 2-dimension problem. That's exactly your problem. The time complexity is O(n^3).
On Oct 8, 2:04 pm, megha <[EMAIL PROTECTED]> wrote: > given N x N matrix of positive and negetive intergers. Write some code > that finds the sub-matrix with teh maximum sum of its elements. > > Any ideas? > > Thanks --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
