ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1144. The Emperor's Riddle

A very nice DP problem.My algorithm is the best of all,it's only O(n*m).
Posted by Blue cat 1 Mar 2002 11:12
Re: A very nice DP problem.My algorithm is the best of all,it's only O(n*m).
Posted by Sqr (5) 1 Mar 2002 15:13
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) ? (+)
Posted by Alyosha Popovich 16 May 2002 23:05
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).
Posted by Edric Mao 2 Sep 2010 18:33
can you give your solution??
Thx
remdy21@live.cn