Description: Application of dynamic programming algorithm for a given number of tower of a few towers, its storage form as shown below the lower triangular matrix. In the few tower, starting from the top in each node can choose to go down or right away, the bottom has been reached. Please find a path, so that path and the largest numerical. Input sample (the number of towers): 915 10 6 82 18 9 519 7 10 4 16 output sample (maximum path and): 59
File list (Check if you may need any files):
动态规划法的应用实验报告.doc
数塔问题.cpp
数塔问题.txt
Download