Examine the case where k = 1. The result is the maximum of the delta of the x coordinates and the y coordinates.
If k = 2 then the result is the minimum of the result to cover a subset of the points with 1 square and the result to cover the other subset with 1 square for all subsets. If k = 3 then you split the answer into a subset with k = 2 and te remaining subset with k = 1. If k = n then the answer is the best of splitting the group into a subset of k = 1 and k = n - 1. Now you have a dynamic programming solution. Precalculate k = 1 results in 2^n * n. -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/31e776cd-a367-46c0-b2b7-2e27ec3e90c4%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
