hi, Can someone give me hints/soln on this problem http://acm.uva.es/p/v102/10271.html
the number of chopsticks is (K+8)*3 , the badness is minimized if we choose neighbours. How do we write the recurrence relation ? which elements form the chopstick triplet. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
