Description: Description of the problem: Given n-stones, the weight of a1, a2 ..., an, requests that it be divided into m heap, the cost of each division is defined as the weight of this pile of stone, the largest and the smallest weight of the square of the difference . Divide the total cost is equal to the cost of each stack and the. Input: nm and a1, a2 ..., an output: sum description of the problem: Given n-stones, the weight of a1, a2 ..., an, requests that it be divided into m piles, each division of the cost of is defined as the weight of this pile of stone, the largest and the smallest weight of the square of the difference. Divide the total cost is equal to the cost of each stack and the. Input: nm and a1, a2 ..., an output: sum
To Search:
File list (Check if you may need any files):
2\2.cpp
.\石子划分.doc
2
Download