Regarding complexity

#1

i done this question by DP but also it give TLE…i don’t understand why???

#2

hello @ranjan.prashant3655
constraint is large O(N^2) dp approach will not work.

use binary indexed tree to solve this problem in o(NLOG(N)).

#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.