Click here to Skip to main content
15,883,336 members

Comments by Jiopik (Top 10 by date)

Jiopik 3-Jan-20 9:23am View    
What is your time complexity?
Jiopik 3-Jan-20 3:14am View    
I agree it would be over engineered if the n <= 10^4. But it's not. And maybe you had to see that even with such algorithm, the time limit still could not be passed. Any suggestion.
Jiopik 2-Jan-20 14:50pm View    
I have provided it. Insead of going to segment trees. Is there a way to improve as it is now.
Jiopik 31-Dec-19 9:30am View    
I can't see what I can do?
Jiopik 31-Dec-19 6:21am View    
The problem is time limit error!