I've just got AC (1.047 CPU) 10245-"Closest Pair Problem" with algo explained in "Introduction".
My time is poor, however, than that of most of yours - and I suppose you used so-called "Line Sweep algorithm".
If you kindly give your comments on this account it will be greatly appreciated.
My problem here is that I need to implement such obscure thing as Red-Black tree (or AVL) before implementing sweep algo itself.
I must admit that all these "rotations" and "balancings" are quite difficult to understand, or at least not obvious, for my capacity (quite limited
![:)](./images/smilies/icon_smile.gif)
Please, tell us of your own experience of mastering advanced search trees.
Thank you.