在一个园形操场的四周摆放N堆石子（N≤100），现要将石子有次序地合并成一堆。规定

每次只能选相邻的两堆合并成新的一堆，并将新的一堆的石子数，记为该次合并的得分。

编一程序，由文件读入堆数N及每堆的石子数（≤２０），

①选择一种合并石子的方案，使得做N－1次合并，得分的总和最小；

②选择一种合并石子的方案，使得做N－1次合并，得分的总和最大。

-Playground in a park-shaped stone piles around the place N (N ≤ 100), is to have the order to merge into a gravel pile. Provided you can only choose two piles adjacent to merge into a new pile, and the number of new pile of stones, recorded the score for the merger. Compiling a program file into the heap by the number of N and every pile of stones, the number (≤ 20), ① stones to choose a merger proposal, made to do N-1 merger, the sum of the minimum score　② select a merger stones The program allows to do N-1 merger, the largest sum of scores.