Using f[i][j] to represent the minimum cost from I to j will turn I from J to i->z->j, K represents the number of sites to go, and the initial location is I, so the end point is i+k, which ensures the last segment is k, so the cycle ends to i<=n-k, and the middle point is the middle. If this is smaller than f[i][j], exchange values

Filename	Size	Update
3-6
3-6\3-6.cbp	1059	2017-11-29
3-6\3-6.depend	101	2017-11-29
3-6\3-6.layout	321	2017-11-30
3-6\bin
3-6\bin\Debug
3-6\bin\Debug\3-6.exe	967597	2017-11-29
3-6\main.cpp	653	2017-11-29
3-6\obj
3-6\obj\Debug
3-6\obj\Debug\main.o	12309	2017-11-29

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．