用动态规划方法解决了石子合并问题

在一个圆形操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2 堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。-Using dynamic programming methods to solve the problem in a circular stone consolidation around the playground placed n heap stones. Stones are to be combined into an orderly pile. Requirements can only choose two adjacent stones piled into a new pile, the pile of stones and a few new record score for the merger.