I think your question should be to find the minimum number of ladders required.
This is a very classic Greedy-Algorithm solved problem. Please refer to Chapter 4 of book "Algorithm Design". On Fri, Oct 1, 2010 at 2:32 AM, mac adobe <macatad...@gmail.com> wrote: > Hi > Please suggest how you think for this problem > Suppose you have many airplanes . Each plane needs a ladder so > that people can board the plane easily . > Now plane will land at time land_time and then fly away again at fly_time . > During this time , people will continue to board the plane and the > ladder should remain attached to the plane. So if plane lands at 3 am and > fly at 3 pm , we need a ladder from 3 am to 3 pm dedicated for that plane. > Given land_time and fly_time of multiple planes in a day , find the maximum > number of ladders your require . > > > --mac > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@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. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
