Description: Given an n stone, its weight, respectively a1, a2, a3, ... , an, to be shown to be divided into m parts, each a division of costs defined in this stone maximum weight and minimum weight square. The total of expenses equal to the sum of m copies of the division of costs and For a given n stones, seeking a division of the program, making the total division of the minimum cost.
[auto translate]
To Search:
File list (Check if you may need any files):
exp.doc
Download