can anyone help how to approach to this DP problem? Let fi(x) = i*(1+log x). Describe a dynamic programming algorithm to input 2 integers x and m and determine how to break x into m integers x1, x2, ..., xm such that f1(x1)+f2(x2)+...+fm(xm) is the largest among all possible ways of breaking x into m integers. Note that x≥m and xi≥1 for all 1≤i≤m
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
