POJ 1695 Magazine Delivery DP

Test instructions

There are n places, the time required between every two points is known, there are now 3 vehicles in Location 1, to send the magazine to 2,3...N, only one car at a time to go, and sent to I must be sent to i-1, to complete the task required minimum time.

Analysis:

DP[A][[B][C] represents the minimum time required for three vehicles from nearly three places in the A,b,c. When N==6, 2,2,1,3,1,3. 3,3,1,2,1,2. 2,2,1,1,1,3 these access sequences can be dp[2][5][6], dynamic planning avoids many superfluous states in the access state space.

Code:

POJ 1695 Magazine Delivery DP