[algogeeks] Re: Interesting Problem : Polynomial-time Algorithm !!!

[Dhyanesh]

The first part occurs when you place the file at a location 'i'. This would cost you Ci , also 'pi' is the place where the last storage server was placed. So for each in between you have to add a cost of '1' extra over the cost  "cost[i+1 , i ]" whic would i -pi.

The second case occurs when you dont put a server at location i. Then you just add a cost of one each for the servers between i and pi.

Just make sure you fill the table in order.

-Dhyanesh

On 3/10/06, gcet <[EMAIL PROTECTED]> wrote:

--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---