Search found 1 match

by farzad.shbfn
Sun Jul 28, 2013 9:48 am
Forum: Volume 4 (400-499)
Topic: 473 - Raucous Rockers
Replies: 16
Views: 7698

Re:

I also just found a counterexample for your current greedy algorithm: 4 11 2 9, 10, 2, 11 optimal solution is: 9 2 11 but your greedy will get: 9 2 unfortunately, the O(n^2 * m) dynamic programming algorithm I have is too slow. And the pruning I inserted seems to be wrong. actually O(n^2 * m) algor...

Go to advanced search