/sci/ - Science & Math

Interval scheduling problem
There are N jobs w_i (i = 1,2, ... N).
The start time of each task w_i is s_i and the end time is t_i.
You must choose to participate or not for each job. If you take part in a job, you have to participate in it from start to finish. That is, they must not overlap in time with other work to participate. It is not permissible for only the start and end moments to overlap.
Find the maximum number of jobs you can participate in.