Search found 1 match

by rnd
Sun Feb 28, 2010 4:08 pm
Forum: Volume 4 (400-499)
Topic: 473 - Raucous Rockers
Replies: 16
Views: 7523

Re: 473 - Raucous Rockers

Hello, Does this problem is a binary knapsack problem with some constraint? The recursion formula: M(i, j) = M(i-1, j) if j-t(i) and j belongs to diffrent discs M(i, j) = max{M(i-1, j), M(i-1, j-t(i)) + 1} otherwise 1 <= i <= n 1<= j <= m*t M(i, j) - maximum number of songs from range 1..i that coul...

Go to advanced search