Algorithm · Weride · Hard
You are organizing a conference that starts at time 0. Several presenters are scheduled, but you have the flexibility to reschedule up to k of them. Presentations cannot overlap because they all use the same room, but they can run back-to-back without any gap. The original order of the presentations must be preserved. Your task is to rearrange the schedule (by rescheduling at most k presentations) so that the single longest uninterrupted block of free time—available for…
Checking your access…