can you give me a hint or explain the question in depth
Lis modified code doubt
Lets say you are given some values, now think about compressing the values such that order doesnt change
eg:, 1 5 10 15
compresses to 1 2 3 4
now use bit or segment to find the longest increasing subsequence.
update numbers as indexed now because at max there will be 10^5 numbers only.
For reference you can have a look at this code.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.