Glebegor-'s blog

Help with this topics, UwU.
By Glebegor-, history, 5 hours ago, In English

Can someone write some problem sets below? I have trouble with this topics: 1. Permutations 2. Brute force 3. DP 4. DFS, BFS 5. Dijkstra 6. BIT 7. nCr, nPr 8. Mod inverse 9. Bitmasks 10. Segment trees 11. Andrew’s algorithm 12. RMQ

Thanks!!!

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

»
5 hours ago, # |
← Rev. 2   Vote: I like it +7 Vote: I do not like it

https://codeforces.com/blog/entry/57282

https://codeforces.com/blog/entry/125623

https://codeforces.com/blog/entry/91363

yea!! UPD:(thanks to the author of that blogs)

→ Reply
  • »
    »
    3 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Thanks! I have seen the first post. They are good!

    → Reply
»
4 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

try to use USACO guide this website has alot of topics to learn with in different levels and good luck:) for oh i forget you can solve segment tree from EDU codeforces and CESE and good luck again

→ Reply
»
4 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

What is andrew's algorithm ?

→ Reply
  • »
    »
    4 hours ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    I have seen it in programming competitive handbook, something like geometrical subset of the verticals in set. Btw, I didn't understand it well, sorry for the my explanation.

    → Reply
»
3 hours ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

This might help: Competitive Programmer's Handbook

→ Reply
  • »
    »
    90 minutes ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Yeah I have read that topic by topic and one of the hardest problem for me was a Andrew's algorithm.

    → Reply