I can see O(N log r), but O(N) seems pretty tough. On May 9, 12:21 pm, "coder.ankur" <[email protected]> wrote: > Can anybody explain how the problem can be optimized to O(N) as > mentioned in the the last of contest analysis for this problem. > > -- > You received this message because you are subscribed to the Google Groups > "google-codejam" 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 > athttp://groups.google.com/group/google-code?hl=en.
-- You received this message because you are subscribed to the Google Groups "google-codejam" 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/google-code?hl=en.
