Обсуждение @ 1071. Никифор 2 @ Timus Online Judge

I use Dynamic Programing ,which find LCS to solve this problem.I got AC,but it is too slow!!!

Послано Yu YuanMing 29 июн 2004 12:37

Re: I use Dynamic Programing ,which find LCS to solve this problem.I got AC,but it is too slow!!!

Послано Sandro 9 авг 2004 14:55

Yes, first I ACed the bruteforce algorithm in 0.187 sec, but later I added to it some mathematical hint. Now it works 0.046 sec.

I'm too ! I used BruteForce , but I'm a bit faster !

Послано Hard ( DHSP ) 23 июн 2005 11:32

866224 Hard (DHSP) Pascal Accepted 0.14 121 KB

Re: I use Dynamic Programing ,which find LCS to solve this problem.I got AC,but it is too slow!!!

Послано BFL 26 окт 2005 14:08

you can have O(s(x)+s(y)) instead of LCS
s(a) is length of a in one's radix.

Re: I use Dynamic Programing ,which find LCS to solve this problem.I got AC,but it is too slow!!!

Послано Romko [Lviv NU] 25 мар 2007 20:02

Brute Force with 0.046 sec and 960 Memory

Обсуждение задачи 1071. Никифор 2