Activity Selection Problem Suppose we have a set S=fa,a2.... of n proposed activities that wish to use a resource,such as a lecture hall,which can serve only one activity at a time.Each activity a has a start time s and a finish timefi,wheres<f<o.If selected,activity ai takes place during the half-open time interval [)Activitiesa and a are compatible if the intervals [s)and [sj,)do not overlap.That is,a;and aj are compatible if si or sj In the activity-selection problem,we wish to select a maximum-size subset of mutually compatible activities. 一个样本输入： 5678 10 8 8 2 11 14 6Activity Selection Problem 一个样本输入：