Playground in a circle around the stones are placed n heap. Stone is to have the order to merge into a pile. Election can only be provided for each of the 2 adjacent heap of stones into a pile of new, a pile of stones and a number of new entry points for the merger. Try to design an algorithm to calculate the n heap into a pile of stones the minimum and maximum points scored.

小石子.txt

• 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．