Description: n heap stones into a circle around, now want to merge into a pile of stones. provided you can only choose two piles next to merge, and a new pile of stones and recorded scores for the sub-merged. design an algorithm, n combined into a pile of gravel pile, so that the sum of at least the final score.
To Search:
- [stone] - Dynamic programming to solve the problem
File list (Check if you may need any files):
456464576456.txt
下载说明.txt
Download