Description: Around in a circular playground placed n heap stones. Stones are to be combined into an orderly pile. Provisions can only choose two adjacent pile into a new pile of stones, a pile of stones and a few new record score for the merger. Try to design an algorithm to calculate the n heap into a pile of stones combined minimum score and maximum score. [Input file] contains two lines, line 1 is a positive integer n (1 < = n < = 100), that has n heap stones. Line 2 n numbers, respectively, the number of stones for each heap.
To Search:
File list (Check if you may need any files):
Stones merger.doc
Download