Description: The merging of classic rock in a park-wide code-shaped around the playground gravel placed N Reactor (N ≤ 100), is to have the order to stone into a pile. The provisions of the election can only be adjacent to each两堆into a pile of new, and a pile of stones a new number in mind for its combined score. For a procedure, read by the document number N and every heap of stones piled several (≤ 20), ① select a stone of the combined program, the N-1 times to do the merger, the sum of the minimum score ② Choose a merger stones program, the N-1 times to do the merger, the largest sum of scores.
To Search:
File list (Check if you may need any files):
石子合并问题(完整).cpp