Need help , Please! [ CF Round #736(Div. 2) — D ]

Правка en1, от Muhammad_mhs, 2021-08-02 06:36:02

My approach to solving this problem was the segment tree with O(n(logn)^2) complexity. but It gives me TLE.

My Submission: 124635301

Please, anyone, help me why this solution gives me TLE

Thanks in advance.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Muhammad_mhs 2021-08-02 06:36:02 281 Initial revision (published)