@all it was said subset rectangle with max sum..... since every square is also a rectangle....
for m*n take the square matrix of n*n (n<m) only m -n +1 options will have to comareuse backtracking to compare the next column's sum to present it will take O(n) time using backtracking...... please correct it if anuthing wrong is dere -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
