Member Avatar for Petr_1

Hi, I would be very glad if someone can help me with algorithm to solve following task.

We have a convoy of cars that are lined up in a row and must cross the bridge. Cars can't overtake each other.
The bridge has limited capacity, which may not be exceeded.
Find the algorithm, which divides cars into groups so that the entire convoy cross the bridge in the shortest time.
Another group is allowed to enter only when the entire previous group cross the bridge.
Weight and speed of each car is known. The speed of group is determined by the slowest of car in the group.

Sample data:
Input
Output

Thank you for your help, Petr

Edited by Dani because: Links converted ot markdown. Please attach files in the future.
  • 2 Contributors
  • 1 Reply
  • 159 Views
  • 9 Hours Discussion Span
  • Latest Post Latest Post by rubberman
Member Avatar for rubberman

Sorry, but we don't do your homework for you. Make an honest attempt, and if we decide to we may help you see the "errors" of your ways! :-) Good luck.

FWIW, this is an elementary queuing problem. Study up on that for a bit first.

Edited by rubberman
Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.