madcannibal's blog

By madcannibal, history, 4 years ago, In English,

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
 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

»
10 months ago, # |
  Vote: I like it 0 Vote: I do not like it

yes you can solve it by recursive knapsack with 2d array also .. i solve it and get AC here is my code : Uva 11658 — Best Coalitions