My C solution in Python 3 got TLE for large. The same solution passed with Pypy 2. My implementation followed the instruction given in the Analysis. For the Range Maximum Query, I used Sparse Table (https://cp-algorithms.com/data_structures/sparse-table.html). By finding L_p1, L_p2, L_p3, R_p1, R_p2, R_p3 for each Ci, we could arrive at the answer. The only part that might be different is how we handle cases when Ci are not distinct.
-- 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/570ea573-64e9-4dc6-b3dc-be41497551e7%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
