Rod Cutting Problem The rod-cuing problem is the following.Given a rod of length n inches and a table of prices pifor i=1,2,....n,determine the maximum revenue r obtain- able by cutting up the rod and selling the pieces. 一个样本输 入及其解： length i 11234 567 9 8 10 price Pi 1 589 10171720 2430 r=1 from solution 1=1 (no cuts), r =17 from solution 6=6 (no cuts), r2=5 from solution 2=2 (no cuts), 7=18 from solution 7 =1+6 or 7=2+2+3, r3 =8 from solution 3=3 (no cuts), rs 22 from solution 8=2+6. r4 10 from solution 4=2+2, r9 25 from solution 9=3+6, rs 13 from solution 5=2+3, rio 30 from solution 10=10 (no cuts). f7:Rod Cutting Problem 一个样本输 入及其解： r7 :