Problem 3221 · Hard

Maximum Array Hopping Score II

Each earlier index is a line in x = nums[j]; keep the upper hull of those lines and binary search it for each landing value.

Open the interactive visualisation