POJ 1695 Magazine Delivery DP

Source: Internet
Author: User

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

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.