Finally solved SPOJ COT Problem

Правка en4, от Apiram, 2023-08-04 10:04:05

https://www.spoj.com/problems/COT/ I saw most mentioned that it could be solved using Persistent Segment Tree,HLD and also Centroid Decomposition. But I tried differently using parallel Binary Search + Fenwick tree.

How
code

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский Apiram 2023-08-04 10:04:05 35
en3 Английский Apiram 2023-08-03 22:25:04 36 Tiny change: 'I saw most' -> 'https://www.spoj.com/problems/COT/\nI saw most'
en2 Английский Apiram 2023-08-03 22:22:41 7 Tiny change: 'd values, we pick node' -> 'd values, pick node'
en1 Английский Apiram 2023-08-03 22:21:20 4406 Initial revision (published)