看算法导论的同学应该知道第15章在讲动态规划,以钢条切割问题作为引论,那么钢条切割问题实际的C代码是怎么实现的呢?图表和题目我就不叙述了,直接看代码 // steercut.cpp : Defines the entry point for the console application.//// 钢条切割问题.cpp : Defines the entry point for the c
Description: The rod-cutting problem is the following. Given a rod of length n inches and a table of prices pi for i D 1,2,…,n, determine the maximum revenue rn obtainable by cutting up the rod and s