Input: A length n and table of prices pi, for i= 1, 2, ..., n. Output:...

  

Transcribed Image Text:

Input: A length n and table of prices pi, for i= 1, 2, ..., n. Output: The maximum revenue obtainable for rods whose lengths sum to n, computed as the sum of the prices for the individual rods. We can cut up a rod of length n in 2n-1 different ways. length i price pi 1 2 3 4 5 6 7 8 1 5 8 9 10 17 17 20 Input: A length n and table of prices pi, for i= 1, 2, ..., n. Output: The maximum revenue obtainable for rods whose lengths sum to n, computed as the sum of the prices for the individual rods. We can cut up a rod of length n in 2n-1 different ways. length i price pi 1 2 3 4 5 6 7 8 1 5 8 9 10 17 17 20

Answer rating: 100% (QA)

1 Answer Heres a Python algorithm to solve this problem def cutrodprices n revenue 0 n 1 for i in ra... View the full answer