sum of all the partitioned rectangles in O(1) reducing our
complexity to O(n^2)..So, our job now is just to precompute the matrix..
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 th
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 val
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 discuss
hey check this out.. http://www.w3schools.com/html/html_forms.asp
Hope this will serve the purpose:)
On Tuesday, 17 July 2012 01:12:02 UTC+5:30, nandita raman wrote:
>
> Hello,
>
> I am working on PHP/HTML/ XML-RPC.
>
> I have a website, where one link shows the list of files as checkboxes and
