On Thu, Dec 9, 2010 at 1:19 PM, ankit sablok <ankit4...@gmail.com> wrote:
> can anyone suggest me how to go about this problem i m finding it > quite tough > > http://www.codechef.com/problems/TEAMSEL/ > > thanx in advance > > Its is the problem similar to minimum difference subarray problem. This can be solved using dynamic programming. Basically you need to divide an array into two subarray keeping their sum's difference minimum. > -- > 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. > > -- Dinesh Bansal The Law of Win says, "Let's not do it your way or my way; let's do it the best way." -- 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.
