Discussion:
Q: You are going on a long horse trip. You start on the road at mile post 0. Along the way there are n horse stations at mile posts m1 < m2 <. mn where each mi is measured from the starting point. The only places you are allowed to stop and change horses are at these stations, but you can choose which of the stations you stop at. You must stop at the final station (at distance mn), which is your destination.
Assume that at a station ti takes 2 hours to change horses and a horse takes (x ln x)/100 hours to travel x miles. Design a dynamic programming algorithm to determine a sequence of stations at which to stop so as to minimize the total hours.
Example:
Number of mile posts (not including post 0): 5
Enter mile posts: 50
250
325
680
850
The minimum time is 50.000000
Stops: 5 4 3 0.