A very nice DP problem.My algorithm is the best of all,it's only O(n*m).

Re: A very nice DP problem.My algorithm is the best of all,it's only O(n*m).

Could you give me any hints of the DP algorithm? Thanks!

(mail to: comars@hotmail.com )

Isn't the problem NP (the multi-knapsack problem) ? (+)

If it is NP, the complexity of the algorithm should be O

(K*something) right ?

Can you give me any hints on your solution ?

mail: scythe@toughguy.net

thanx a lot

Re: A very nice DP problem.My algorithm is the best of all,it's only O(n*m).

Posted by

Jerry 17 Aug 2007 16:34

Could you give me any hints of the DP algorithm? Thanks!

(mail to: cpp_student@163.com )

Re: A very nice DP problem.My algorithm is the best of all,it's only O(n*m).

Posted by

love_lq 26 Aug 2008 19:48

I also think it's nice!My algorithm use 0.5s.I use some random.It's nearly O(n*m)

Re: A very nice DP problem.My algorithm is the best of all,it's only O(n*m).

Posted by

John 27 Oct 2008 13:22

guy in countryside.

Re: A very nice DP problem.My algorithm is the best of all,it's only O(n*m).

can you give your solution??

Thx

remdy21@live.cn