Dynamic activity selection
I am having some problem with a variation of the activity selection problem. This is homework so I'm just looking for some help with the recursion. It is a weighted activity selection where each interval has a start and finish and profit. I need to find the max profit that can be achieved however the variation is that there has to be more "short" length intervals than "long". Where a short interval is considered to be less than 5 (from start to finish). I can solve the maximum profit problem but not sure how to handle the variation.