|
|
вернуться в форумWhat is the best algorithm for this problem? Could someone giveme an idea? (-) nothing is perfect 8-) > I dont reall know for sure. Personally I stores every distinct whyte line as a two-longit record. Whenever a black or a white line is put, you cant get more than just one additional(new) distinct white line(think why). So 5001 records should be enough. This is something like a o(N^2) algorythm, at least it works good enough 8-)) |
|
|