CodePudding user response:
What's the problem?CodePudding user response:
Simple dynamic programming, first will start time to sort all the test according to theRepresentatives of dp/n, t, n before the exam, in 0 ~ t time can attend the exam of most
Dp/n, t={dp/n - 1, t (endT & lt; T), the Max (dp (n - 1, t), dp/startT n - 1, + 1)
Might have some detail problems, way of thinking is always so
O (N * Max (bi))