human
Activity Selection Problem | Greedy Algo | Prints a maximum set of activities that can be done by a single person , one at a time n -- > Total number of activities s [ ] -- > An array that contains start time of all activities f [ ] -- > An array that contains finish time of all activities.
The first activity is always selected.
Consider rest of the activities.
If this activity has start time greater than or equal to the finish time of previously selected activity , then select it.
Driver program to test above function"
How can the above be solved in Python?
assistant
#Here is code to activity Selection Problem and the other steps required.
 def printMaxActivities ( s , f ) :
	n = len ( f )
	print " The ▁ following ▁ activities ▁ are ▁ selected "
	i = 0
	print i ,
	for j in xrange ( n ) :
		if s [ j ] >= f [ i ] :
			print j ,
			i = j
s = [ 1 , 3 , 0 , 5 , 8 , 5 ]
f = [ 2 , 4 , 6 , 7 , 9 , 9 ]
printMaxActivities ( s , f )