Editorial for DMOPC '14 Contest 6 P2 - Longest Tunnel

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.

Submitting an official solution before solving the problem yourself is a bannable offence.

Author: Phoenix1369

Calculate the difference between the second and the first index for each tunnel. The maximum value over all N queries is the desired result.

Time Complexity: \mathcal{O}(N)


There are no comments at the moment.