|
|
вернуться в форумI don't know how to solve it. I don't know how to solve this problem. Give me some hints please. Happy new year. Me too at the first time. If you want more details,you can email to "hyz12345678@163.com". This is a NP problem It is a "multi-knapsack", which is proved to be NP. So, use recursion with some optimizations. (NP = Non Polynomial) -> that means that there is no efficient algorithm (well, not exactly that, but almost the same in this case) Re: I agree with you. But to get AC is very easy. Isn't complete search with a few optimizations enough? Or even, a greedy? Re: I agree with you. But to get AC is very easy. > Could you help me?? mail:miguelangelhdz@hotmail.com, or here, i did it, but get time limit exced :| |
|
|