hmm, that's true try mine, 1438, it's not more than 4N
On May 12, 1:03 pm, Fabrizio <[email protected]> wrote: > In both solutions you fill the array of next indexes and values in > O(n^2), so the solution is not O(n)... > > On May 12, 6:49 am, wRabbit_AlMag <[email protected]> wrote: > > > > > > > See solution of author 1210. If it's not clear, i can describe the > > idea. > > > > > So... Has anyone figured the O(N) solution out? > > > > -- > > > 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 > > 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 > 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.
