Description: 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.
To Search:
File list (Check if you may need any files):
小石子.txt
Download