Death_And_Despair's blog

Segment Tree

By Death_And_Despair, history, 10 years ago, In English

Hello codeforces

can any one please suggest some good and easy(for a beginner like me :3 ) segment tree problems to start with ?

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

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

I think they are good problems
Link

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

Classic Segment Tree Problems

459D - Pashmak and Parmida's problem

61E - Enemy is weak

380C - Sereja and Brackets

474F - Ant colony

339D - Xenia and Bit Operations

356A - Knight Tournament

292E - Copying Data

501D - Misha and Permutations Summation

515E - Drazil and Park

540E - Infinite Inversions

609F - Frogs and mosquitoes

594D - REQ

455E - Function

220E - Little Elephant and Inversions

338E - Optimize!

19D - Points

351D - Jeff and Removing Periods

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

Segment Tree Lazy Propagating

446C - DZY Loves Fibonacci Numbers

240F - TorCoder

121E - Lucky Array

610E - Alphabet Permutations

115E - Linear Kingdom Races

438D - The Child and Sequence

52C - Circular RMQ

145E - Lucky Queries

558E - A Simple Task

580E - Kefa and Watch

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

Can anyone give me a link where I can find links for the classic problems for the most standard and famous algorithms.

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

    I think you can find some really good classic and standard problems about some useful algorithms in competitive programming 3 book , I also suggest hackerearth practice problems(you can find high quality tutorials about alot of topics there) and also you can find some classic problems here link

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

      I tried it with spoj classifier but there are just too many scattered problems on spoj and with no editorials , it makes life very tough. I'll use the tags feature for codechef, codeforces. And would definitely try hackerearth. Thanks anyway.

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

Please recommend some good tutorials for segment tree and binary indexed tree?

→ Reply