The PDF containing the solution is here: http://groups.google.com/group/algogeeks/web/AlgorithmQuestionSolution.pdf
On Mar 25, 8:36 am, "[EMAIL PROTECTED]" <[EMAIL PROTECTED]> wrote: > Any chance I could get a copy of that as well? :) > > On Mar 21, 3:49 am, Ashesh <[EMAIL PROTECTED]> wrote: > > > Done. > > > On Mar 20, 4:45 pm, VRC <[EMAIL PROTECTED]> wrote: > > > > I am also interested to know about the solution? Would you please > > > email me? Thanks. > > > > On 3月16日, 下午8時56分, Ashesh <[EMAIL PROTECTED]> wrote: > > > > > I have emailed you the solution. Please check our email and ensure > > > > that it has not been marked as spam (gmail's spam filters are > > > > effective but hyperactive). > > > > > Ashesh. > > > > > On Mar 16, 4:21 am, BillyBob123 <[EMAIL PROTECTED]> wrote: > > > > > > Hi, > > > > > > I'm new here and have an algorithm question that I need to solve. If > > > > > you are not able to solve, please point me in the right direction so I > > > > > can get started. Thank you. > > > > > > Suppose it's nearing the end of the semester and you're takingn > > > > >courses, each with a final project that still has to be done. Each > > > > > project will be graded on the following scale: It will be assigned an > > > > > integer number on a scale of 1 to g > 1, higher numbers being better > > > > > grades. Your goal, of course, is to maximize your average grade on > > > > > thenprojects. You have a total of H >nhours in which to work on > > > > > thenprojectscumulatively, and you want to decide how to divide up > > > > > this time. For simplicity, assume H is a positive integer, and you'll > > > > > spend an integer number of hours on each project. To figure out how > > > > > best to divide up your time, you've come up with a set of functions > > > > > {fi : i = 1, 2, ...n} (rough estimates of course) for each of yourn > > > > >courses; if you spend h <= H hours on the project for course i, you'll > > > > > get a grade of fi(h). You may assume that the functions fi are > > > > > nondecreasing: i.e., if h < h`, then fi(h) <= fi(h`). So the problem > > > > > is: Given these functions fi, decide how many hours to spend on each > > > > > project (in integer values only) so that your average grade, as > > > > > computed according to the fi, is as large as possible. In order to be > > > > > efficient, the running time of your algorithm should be polynomial in > > > > >n, g, and H; none of these quantities should appear as the exponent in > > > > > your running time. > > > > > > Thank you very much for all your help.- 隱藏被引用文字 - > > > > > - 顯示被引用文字 - --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---