文件名称:StoreMerger
介绍说明－－下载内容均来自于网络，请自行研究使用
算法设计。题目要求：在一个圆形操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2 堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分。-Algorithm design. Title Requirements: playground in a circle around the stones are placed n heap. Stone is to have the order to merge into a pile. Provisions can only choose 2 adjacent stones piled into a heap of new and new pile of stones a few in mind for its combined score. Try to design an algorithm to calculate the n heap into a pile of stones the minimum scores and maximum scores.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
E4 -- 石子合并.files
E4 -- 石子合并.htm
[E4].StoreMerger.cpp
E4 -- 石子合并.htm
[E4].StoreMerger.cpp