Last div-3 F problem

Правка en1, от Please_Read, 2022-06-09 04:06:42

In problem F, the rotation of string will cost o(n^2) time. it's ok for this problem. But I want to know is there any o(n) approach to do this work?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Please_Read 2022-06-09 04:06:42 172 Initial revision (published)