Harder version of today's Div.3C

Правка en3, от tyristik, 2024-07-26 21:31:43

How to solve today's C problem if alphabet is not $$$26$$$ characters but rather $$$O(n)$$$? I could only come up with simple offline $$$O(q \sqrt n)$$$ solution using basic MO algorithm. Any ideas?

Теги harder, challenge

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский tyristik 2024-07-26 21:31:43 17
en2 Английский tyristik 2024-07-26 21:28:38 1 Tiny change: 've ![today's C proble' -> 've ![todays C proble'
en1 Английский tyristik 2024-07-26 21:27:52 251 Initial revision (published)