Description of the problem: Given n

代码说明：

问题描述： 给定n个石子，其重量分别a1,a2,a3...an,要求将其划分成m份，每一份的划分费 义为这份石了中最大重量与最小重量的差的平方。总划分费用等丁m份划分费用之和。 编程任务 对于给定的n个石子，求一种划分方案，使得总划分费用最小。-Description of the problem: Given n-stones, its weight, respectively a1, a2, a3 ... an, asked that it be divided into m copies, each of the division of costs defined as the weight of the stone of the largest and the smallest weight difference the square. Small m the total costs were divided into the sum of the cost. Programming tasks for a given n-stones, seek a kind of division, making the total cost of the smallest division.