| ENG RUS | Timus Online Judge |
Discussion of Problem 1297. PalindromeThis problem is very easy.We can solve it with O(N^2).But it seems like that exist a O(N) algorithm. Posted by zhougelin 15 Sep 2004 21:40 Re: This problem is very easy.We can solve it with O(N^2).But it seems like that exist a O(N) algorithm. Posted by Gheorghe Stefan 16 Sep 2004 19:36 Re: This problem is very easy.We can solve it with O(N^2).But it seems like that exist a O(N) algorithm. Posted by zhougelin 18 Sep 2004 20:10 |