Recurrence problem

[tonnyspain]

There are two integer lists: V(1..N) and W(1..N)
V(i) is positive and W(i) is non-negative for all i. (i.e. W(i) can be
zero)

Now I'm going to select the elements from the V list, the constraint
is : if I pick V(i), then I must avoid taking V(i+1),V(i+2),..., V( i+
W (i) )

The problem is how to maximize the sum of the V's I can select.

Can anyone help me out by using a recursive way, please? Thanks a lot!!!

[weaknessforcats]

Are you able to solve this by using a loop??

All recursions can be replaced by a loop.

I suggest to get a loop working and then convert the loop to a recursive function. The condition check in the loop will migrate to the recursive function.

[tonnyspain]

Hi,

thanks a lot for your help!

But I don't quite understand your suggestion yet, would you mind giving more detail? pseudo-code would be help.

Thanks a lot again!!

Regards,
Tonny

[tonnyspain]

I think I got the recursive formula already. Thanks anyway!