al+1, ..., ar. I am using persistent segment trees to process queries online.but i am getting wrong answer. I am not able to find why my
Can you answer my questions? +7 who_i_am 13 months ago 4 Comments (3) Show archived|Write comment? Monarcle 13 months ago,#| 0 Pretty much the answer Or in short, no. As far as I know, I don't see many problems that can only be solved by using interval trees (or I am dumb...
In addition, the quality of the above question set is also good, with various difficulties, and it is also a very good choice to brush the questions in it. HackerRank HackerRank is actually a bit similar to the codeforces just introduced above. The main content also includes exercises and co...
★★★ Codeforces For quick answers, Codeforces is definitely the go-to place to ask about anything competition-related. ★★★ Competitive Programming - Quora You would typically get more elaborate answers on Quora, but you might not have your questions answered straightaway. ★★☆ Theoretical ...
Segment Tree Beats are a really cool, and fairly advanced, modification you can make to segment trees in order to handle range-min-with queries. I talk about what they are and why they work inEpisode 4 of AlgorithmsThread. Feel free to comment any questions about what I covered in the ...