n堆石子围成一个圆,现将欲石子合并成一堆.规定每次只能选相邻两堆合并,并将新的一堆石子数记为该次合并的得分.设计一算法,将n堆石子合并成一堆,使最后的得分总和最少. -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 record