Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

anudeep2011's blog

Tutorial on Persistent Segment Trees + Editorial for 2 SPOJ problems (COT & MKTHNUM)
By anudeep2011, 12 years ago, In English

I really liked the problem COT and concept used in that. So I decided to write a blog post on it.

This is my 2nd blog post

http://blog.anudeep2011.com/persistent-segment-trees-explained-with-spoj-problems/

  • Vote: I like it
  • +46
  • Vote: I do not like it

Comments Comments (7)
| Write comment?
»
11 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Hello Anudeep Sir,i am giri from Aitam college Tekkali,Srikakulam.I liked your tutorials.I was solved 1st problem in most contests.But i am unable to solve 2nd problem onwards in contests.Help me for improve my self.Give me some suggestions.

→ Reply
»
10 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Hi Anudeep!

This blogpost was of great help. I have referred to your other blogs to understand data structures often. Thank you so much! Would it be possible for you to make more video editorials? I saw the one on HackerEarth for Sqrt Decomposition.

Anyhow, I picked the task of making a video tutorial on this myself! Here is the link. It explains Persistent Segment Trees and the solution to MKTHNUM.

→ Reply
»
9 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

This tutorial is very good, I have a doubt though...

I don't see in the second problem why do we need the values to be different? It seems to me it will still work... Also, MKTHNUM is just a particular case of COT (when the tree is a line)... so it doesn't make sense to me that in COT the values can repeat but in COT they can't... Am I missing something here?

thanks

→ Reply