Description: Placed around a circular playground with n stack stone, stone is now to have the order to merge into a pile, can only be provided for each adjacent两堆into a pile of new, and a pile of stones a few new terms for its combined score. Programming to derive the n heap into a pile of stones the minimum and maximum points scored. Input: the first line an integer that the number of stones piled, n the number of the second line, said the number of stones in each pile. Output: the first line is the smallest number of points, the second line is the largest of several scoring
To Search:
File list (Check if you may need any files):
石子合并问题.cpp
Download