Description: Merger stones in a circle around the playground n heap stones are placed. Stone is to have the order to merge into a pile. Provisions can only choose 2 adjacent stones piled into a heap of new and new pile of stones a few in mind for its combined score. Try to design an algorithm to calculate the n heap into a pile of stones the minimum scores and maximum scores.
To Search:
- [040320164_2] - smallest and M! This is the realization
- [similarexamples.Rar] - This is a development of the VC similar
- [suanfa] - A 3000 random integer, using the random
- [shizihebing] - This is a problem on the stones combined
- [bianyiyuanli] - Compilation Principle of teachers for le
- [JSPenv] - Software requirements list: (in this con
- [stone] - Playground in a circle around the stones
- [carpolite-unite] - err
- [3_7] - Digital triangle problem, Wang Xiaodong,
- [stone] - Analysis Operator Course to achieve merg
File list (Check if you may need any files):
Download