|
|
вернуться в форум
Edited by author 29.10.2008 10:05 You are mistaken removing your message.
I think that the problem is difficult,
many solvers used random searh and brute forse
and with n->1000 number of have solved will -> 10-30
So talk about algo was helpfull. I don't think this task will be that difficult... I do it in o ( n ^ 2 ) and it's not that hard and i thing i can do it n logn with some optimizations... |
|
|
