Around the playground in a circular heap stones placed N (N ≤ 100), are to merge into a gravel pile orderly. Requirements can only choose two piles adjacent into a new pile, the pile of stones and the new number, record the score for the merger. Compile a program that reads the stack number N and the number of each pile stones (≤ 100) to choose a merger proposal stones, were obtained for the merger of the N stack a pile of stones, you can get the maximum score and minimum score Enter multiple examples. The first act N, the number of stone heap following a plastic behavior of N, representing the number of stones for each heap. When N = 0, the input end.

stone.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．