Please_Read's blog

Last div-3 F problem
By Please_Read, history, 3 years ago, In English

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?

  • Vote: I like it
  • -10
  • Vote: I do not like it

Comments Comments (1)
| Write comment?
»
3 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

By KMP, it can be optimized to O(n). See 159827269

→ Reply