how to do that in O(|s|^2)? 2010/11/16 anoop chaurasiya <anoopchaurasi...@gmail.com>
> will O(|s|^2) dp work....or u need something more efficient than that.... > > > On Tue, Nov 16, 2010 at 1:51 PM, lichenga2404 <lichenga2...@gmail.com>wrote: > >> A palindrome is a string which is identical to itself in reverse >> order. For example >> \ABAAABA" is a palindrome. Given a string, we'd like to break it up >> into the small- >> est possible number of palindromes. Of course, any one-character >> string is a palindrome >> so we can always break a length n string into n palindromes. Design an >> e cient al- >> gorithm to determine the minimum number of palindromes in a >> decomposition for a >> given string, and analyze the running time. You may assume you are >> given a proce- >> dure Palindrome(S) which runs in time O(jSj) and returns true if and >> only if S is a >> palindrome. >> >> How to solve this problem with the dynamic programming method? >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algoge...@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > Anoop Chaurasiya > CSE (2008-2012) > NIT DGP > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- licheng -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.