|
|
back to boardWA 5? Posted by Tkach 5 Nov 2005 01:04 Only sort array and use binary search... Who can help??? Re: WA 5? How you passed first test? Re: WA 5? use sort and binary search would timelimit at #11 my code: [code deleted] Edited by moderator 22.02.2006 22:05 Re: WA 5? Posted by boaz 6 Nov 2005 13:15 how about trie tree? (mle) Re: WA 5? Posted by Tkach 6 Nov 2005 14:58 First I have WA1 but then I found my mistake... Check this- +aaaa +a ?a Right answer is: a a aaaa Re: WA 5? Posted by Tkach 6 Nov 2005 15:03 use sort and binary search would timelimit at #11 Why tle11? Its only: n log n You try to use other sort procedure(not qsort)? Maybe in 11 test qsort works n*n(unreal?)... Re: WA 5? My program gives right answer for this test! Re: WA 5? Try this test: +eee +eef +eed ?e answer: e eed eee eef Re: WA 5? Posted by Tkach 9 Nov 2005 19:27 Try this test: +eee +eef +eed ?e answer: e eed eee eef My program get right answer for this test... I dont understand whats wrong... Re: WA 5? Posted by Tkach 9 Nov 2005 20:15 Sorry for post code but i cant find mistake... Maybe you can??? [code deleted] Edited by moderator 22.02.2006 22:08 |
|
|