Can any one explain approach of HILLJUMP problem please? I tried DP, along with segment tree and binary jumping method(not sure what we call it actually) and lazy propagation, but could not find out reasonable time complexity… Please Help… I can show my detailed approach but I don’t think that would matter. Please help…
Deleting the post. Let us make the discussion on the editorial page itself.