How do we approach this problem?
the dp solution times out.
LIS Modified DP
Please try the problem using fenwick tree(BIT), Think in terms of mapping the numbers and finding the sum for each index using BIT. Expected complexity for each test case will be around n log n
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.