ENG
RUS
Timus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board
Discussion of Problem
1297
. Palindrome
How can it be done with only O(n) ?!
Posted by
Dilyan
2 Jul 2004 15:30
Re: How can it be done with only O(n) ?!
Posted by
sloboz
4 Jul 2004 14:57
with suffix trees,
http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Tree/Suffix/
© 2000–2024
Timus Online Judge Team
. All rights reserved.
