| ENG RUS | Timus Online Judge |
Common BoardThe problem1144 is NP-complete, isn't it? To admins: it is impossible to post message on the problem1144's board. Posted by Andrew V. Lazarev 22 Nov 2001 02:53 I believe there must be a forumla, but I don't know. Posted by Li, Yi 22 Nov 2001 05:50 what is "the maximum result that the emperor accepts" Posted by snake 22 Nov 2001 06:52 Greedy algorithm, I think. Posted by Li, Yi 22 Nov 2001 09:44 I think this is a number which not less the minimum difference. But I don't know for what K is given. N=10000, M=3, K=0... and... how to solve? Posted by Andrew V. Lazarev 22 Nov 2001 15:13 Greedy algorithm is a heuristics in this case... I think... Posted by Andrew V. Lazarev 22 Nov 2001 15:15 And do you know the greedy algorithm? Posted by Li, Yi 22 Nov 2001 16:08 Yes, and not one, but all of them don't work on my tests :( Posted by Andrew V. Lazarev 23 Nov 2001 00:07 Test cases are not so difficult :) Posted by HNT 23 Nov 2001 12:20 I use Greedy Algorithm to solve. Posted by HNT 23 Nov 2001 12:26 |