hi there, Need help on this..any way or suggestion how to solve this problem.. any help would be appreciated.
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 Thanks -- 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?hl=en.
