Hasan's blog

Persistent Segment Tree
By Hasan, history, 7 years ago, In English

Recently I've been reading about persistent segment tree and I've solved the sample problem that they gave me. Can someone give me some problems about this algorithm and thanks.

If you want to learn it you can see this blog persistent segment tree.

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

»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it
  1. COT | SPOJ
  2. DQUERY | SPOJ
  3. Morgan Stanley Codeathon 2015 | HackerRank
  4. MKTHNUM | SPOJ
  5. TTM | SPOJ
  6. Persistent Bookcase | Codeforces Div2 Round 368
→ Reply
  • »
    »
    7 years ago, # ^ |
    ← Rev. 2   Vote: I like it +7 Vote: I do not like it

    Thanks a lot :D

    Just one or two of them are persistent segment tree problems .. the rest are just segment tree or normal problems.

    → Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +3 Vote: I do not like it

I think you have to search in geeksforgeeks there are a lot of problems of each kind. TTM on spoj this is a nice persistent segment tree problem.

→ Reply
»
7 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Check this

A2OJ

→ Reply
»
7 years ago, # |
  Vote: I like it +3 Vote: I do not like it

After seeing your blog, i just created blog to share all problems together. Here it is.

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

Try this one

here

→ Reply