Uva 11658 — Best Coalitions

Revision en1, by madcannibal, 2015-08-22 10:15:08

is it possible to solve it by a recursive knapsack algorithm ? it take Time limit exceed when i memo it in 2d array , and if it is impossible how can i solve it by 1d subset sum ? thanks in advance :D

Tags uva


  Rev. Lang. By When Δ Comment
en1 English madcannibal 2015-08-22 10:15:08 230 Initial revision (published)