Can any one help me with this ...Any DP solution?

On Sunday, 12 August 2012 17:48:07 UTC+5:30, sahil taneja wrote:
>
> Divide 2D array into 4 parts. Compute sum of each partition and get max 
> value from the four of them. For all possible partitions get min value of 
> such max values computed.
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/tNlJhsd8r-MJ.
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.

Reply via email to