OMG, finally Accepted...

I used DP with byte[10^7], and it actually works kinda slow (~0.85s) and uses 12Mb.

Tho I saw some solutions in java in 0.5-0.6s with less than 1 Mb... I wonder what they did...

You may kept last about 20 symbols, and 20 state of dynamics.
Hmm, my scaning char by char get TL.

Edited by author 13.08.2010 14:05

Edited by author 13.08.2010 14:05

AC in Java without using DP only search and replace strings in an array of byte0.765sec.    7466 КБ