Dynamic programming highest total value Dynamic Programming, choosing the highes

Question

Dynamic programming highest total value

Dynamic Programming, choosing the highest total value.

dynamic-programming

The Data: A list of integers increasing in order (0,1,2,3,4,5.......) A list of values that belong to those integers. As an example, 0 = 33, 1 = 45, 2 = 21, ....etc.

And an incrementing variable x which represent a minimum jump value.

x is the value of each jump. For example if x = 2, if 1 is chosen you cannot choose 2.

I need to determine the best way to choose integers, given some (x), that produce the highest total value from the value list.

Explanation / Answer

Lis is the problem that can be solved the using dynamic program

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.