Problem 3538 · Hard

Merge Operations for Minimum Travel Time

Merging a sign hands its time to the next sign, so a DP over the kept signs finds the cheapest set of k merges.

Open the interactive visualisation