OBI
OBI — Olimpíada Brasileira de Informática (Brazil)
Tecnicas De Projeto De AlgoritmosEnglish
Exam overviewPractice session
In the classic Interval Scheduling problem (Activity Selection), you are given N activities, each with a start time S[i] and finish time F[i]. Which greedy strategy is provably optimal for selecting the maximum number of mutually compatible non-overlapping activities?
Loading your practice session…