11548 - Blackboard Bonanza
Moderator: Board moderators
-
- Experienced poster
- Posts: 136
- Joined: Sat Nov 29, 2008 8:01 am
- Location: narayangong,bangladesh.
- Contact:
Re: 11548 - Blackboard Bonanza
Thank u Mr.sohel for ur help.Acc.
Life is more complicated than algorithm.
http://felix-halim.net/uva/hunting.php?id=32359
For Hints: http://salimsazzad.wordpress.com
http://felix-halim.net/uva/hunting.php?id=32359
For Hints: http://salimsazzad.wordpress.com
Re: 11548 - Blackboard Bonanza
Thanks Darko.... your post is really helpful. I got ac in 0.804 sec.Darko wrote:The original statement was something like: Given N strings, find two that can give you the largest number of matched characters between them if you write one underneath the another. You can see that there are so many problems with that statement but, in retrospect, it would have been less confusing if we just left it that way.
![:)](./images/smilies/icon_smile.gif)
Re: 11548 - Blackboard Bonanza
can anyone give me test caes....iam getting WA....here's my code http://ideone.com/4GJJm3