You are viewing a single comment's thread. Return to all comments →
It says that the two consecutive problems that you solve in a given day should have a minimum difference of K in their vi ( and not every pair of problems that you solve in a given day)
n=5, k=1; 5 3 4 5 6 is can be solved in a given day because that sequence has atleast a variation of 1 between consecutive numbers that is met.
However, if instead it was n=3, k=1; 5 5 6, then you need minimum 2 days to solve it.
It also mentions that the difficulty of problems within a same day must increase . So you cannot solve 3 4 5 5 6 in that order on a same day, because you are not increasing difficulty from 5 to 5.
Therefore, I have the same doubt, seems like you need 2 days to solve the second example for me too.
I can only assume that: " Problems with similar vi values are similar in nature" means you can solve all fives at the same time, but that might be stretching it