Lets say the Amount of petrol is Pi and distance to next petrol pump is Di for ith petrol pump.
start from i=1, j=1 S =0 while (i<=n) S += Pj - Dj; if S >= 0 && j = i-1 return i if S < 0 && j = i-1 return 0 else if S >= 0 j++ mod n; else if S < 0 j ++ mod n, i = j , S = 0; return 0 it will traverse atmost twice, and hence O(n). no extra space required. On Mon, Oct 24, 2011 at 4:06 AM, Aniket <aniket...@gmail.com> wrote: > Suppose there is a circle. You have five points on that circle. Each > point corresponds to a petrol pump. You are given two sets of data. > > 1. The amount of petrol that petrol pump will give. > 2. Distance from that petrol pump to the next petrol pump. > > (Assume for 1 lit Petrol the truck will go 1 km) > > Now calculate the first point from where a truck will be able to > complete the circle. > (The truck will stop at each petrol pump and it has infinite > capacity). > Give o(n) solution. You may use o(n) extra space. > > -- > 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 > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Nitin Garg "Personality can open doors, but only Character can keep them open" -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
