Dynamic programming equation we all know, that is, f [i, j] = min (f [i-1, j-1], f [i-1, j], f [i, j-1], f [i , j+ 1])+ a [i, j] However, many people would suspect that the aftereffect of这道题give up the practice of dynamic regulation. Originally, I also want to Dijkstra, later changed twenty lines did not tell me pascal on an array of cross-border ... ... (dist: array [1 .. 1000* 1001 div 2 ]...) watched helplessly while the title xj_kidb1 solution the beginning also think there is a problem, then suddenly see the light ... ... repeatedly dynamic regulation. Difficult to easily down the mountains, we can walk down from the final output f [n] [1]. xj_kidb1 a skill is important, every time the f [i] [0] = f [i] [i], f [i] [i+ 1] = f [i] [1] (xj_kidb1 solution of the title is also wrong a)

Packet : 13898356sph_5.rar filelist
sph_5.doc

• 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．