i am not able to get / find the approach
please give me a hint or some approach of this qn
LIS MODIFIED question
you are write , now think about compressing the values such that order doesnt change
exx , 1 5 10 15
compresses to 1 2 3 4
now use bit or segment
i still dont get the approach
i dont know on what parameter should i construct BIT or Segment tree
update numbers as indexed now because at max there will be 10^5 numbers only
thanks sir
and i found a similar question on geeks for geeks so am referring that as well