Introduction - If you have any usage issues, please Google them yourself
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.