Description: In a playground around the stones are placed n heap. Stone is to have the order to merge into a pile. Provisions in the merger process can have up to m (k) election k heap stones into a pile of new, 2 ≤ k ≤ n, the combined cost for the new pile of stones a few. Try to design an algorithm to calculate the n heap a pile of stones into the smallest total cost.
To Search:
File list (Check if you may need any files):
Download