Open dcrystalj opened 5 years ago
The given problem is conditioned on that a single person has to visit each event in the schedule for its entire duration. You can't pick all events because, e.g., A and B overlap.
The author should make it clear two events are valid if they overlap on their boundary, e.g, A and C.
I don't understand instructions of given problem
scheduling
atgreedy algorithms
. Can you provide some extra reference for it or explain in detail what does it meanfind a schedule that includes as many events as possible
?From given question i don't understand why not choosing every possible event.