Urgent Recurrence Problem, Please Help !

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? Thanks a lot!!!

.

Relevant Pages

  • Urgent Recurrence Problem, Please Help !
    ... There are two integer lists: ... Now I'm going to select the elements from the V list, the constraint ... The problem is how to maximize the sum of the V's I can select. ...
    (comp.theory)
  • using random with constraints
    ... i would like to generate random vectors that have the ... constraint that the components should sum to zero, ...
    (comp.soft-sys.matlab)
  • Re: using random with constraints
    ... i would like to generate random vectors that have the constraint that the components should sum to zero, and that the components are picked from some distribution. ...
    (comp.soft-sys.matlab)