Обсуждение @ 1144. The Emperor's Riddle @ Timus Online Judge

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

Послано Blue cat 1 мар 2002 11:12

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

Послано Sqr (5) 1 мар 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) ? (+)

Послано Alyosha Popovich 16 май 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).

Послано Jerry 17 авг 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).

Послано love_lq 26 авг 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).

Послано John 27 окт 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).

Послано Edric Mao 2 сен 2010 18:33

can you give your solution??
Thx
remdy21@live.cn

Обсуждение задачи 1144. The Emperor's Riddle