I got TL#6.

After that just a little bit updated my solution:

int max( int pos, int len )
{
..if ( ch[pos][len] )
....return dp[pos][len];
---
....ch[pos][len] = 1;
....dp[pos][len] = res;
....return res;
---
}

and got AC in 0.015s.

Edited by author 23.03.2010 20:30

I get TLE in #6 too , can you explain in detail？

Well, I checked my solution and it didn't seem that could exceed the time limit... Weird... I've got TLE #6 too.

Can you explain in detail??I'm afraid i can't understand.....

oh,now I get AC.Just a little mistakes.