|
|
вернуться в форумDoes this problem has a deterministic polynomial solution? If such solution exists, can anybody send it to me (ioi@list.ru) No, combination of deterministics and NP is one solution, but the algorithm is elementary greedy (-) > Re: No, combination of deterministics and NP is one solution, but the algorithm is elementary greedy (-) I can't understand how the solution can be greedy :). If we take M = 2, we'll get problem about stones and two piles, which is NP-hard. Maybe I misunderstood the problem? And I can realize WHAT IS K :) |
|
|