The analysis claimed the fancy solution reduced the time from O(256*256*N) to O(256*N). But I think it can only decrease the time by an almost constant factor, to around 1/M in this case. If we make the pixel value number a variable S, the complexity is always O(S*S*N).
Can anybody help me clarify this point? Thanks. -- 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.
