Блог пользователя UttamDhakar11

Автор UttamDhakar11, история, 3 месяца назад, По-английски

Hi Coders!!!

I am doing CP from a year continuously and good enough to solve problems on Graph, DP, Bitmask, Segment tree (Sometimes), etc. I generally solve problems on graph around 1700 rated. Sometimes I solve problem on Binary lifting as well, since I know enough about it.

I want to learn more advance topic on graph, So that I can able to solve more rated problem on graphs. Please tell me some more advance topic on graph in Time complexity around N Log(n) just like in Binary lifting, Segment trees.

Полный текст и комментарии »

  • Проголосовать: нравится
  • 0
  • Проголосовать: не нравится