Variation of longest increasing subsequence

#1

is there any nlogn approach using binary search and arrays for maximum sum increasing subsequence as for longest increasing subsequence?

#2

i don’t think so @Rj.25. also i cant understand your question clearly

#3

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.