I thought my algorithm works with O(nlogn), but it is misconception. It's complexity really is O(n^2logn).

This is like topcoder, but it is similar to ICPC than topcoder. Problems need little bit heavy implementation, and you allow to get many many times of WAs! Let's join here!