Sorry. This takes O(n) space, too for an indexable array.
There is so far as I know no quick and dirty way of combining simple
algorithms or ideas to get this. You need to come up with an original
algorithm.
--~--~-~--~~~---~--~~
You received this message
hey guys
if you have done internship at microsoft india development centre then
please do share your experience with me.
thanks
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to
anybody can think on this problem?
--~--~-~--~~~---~--~~
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
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
