Problem 3439 · Medium

Reschedule Meetings for Maximum Free Time I

Moving a run of consecutive meetings merges the free gaps around them, so the best choice is the largest sum of k+1 neighbouring gaps.

Open the interactive visualisation