I have solution, but I need some help.

I have an O(n*log(n)) algorithm, which works successfull on all test

cases at my Celeron 300. The time of working is incredible low (I

used test with 15000 stars), but timus gives me Time limit exceeded.

If anyone here has an idea where is the matter, I am ready to share

my program with him.

Re: I have solution, but I need some help.

Mine is O(C*n).C is a constant number!

Consider the most difficult way to make your programme been dead!

Do not ignore any side!

If your programme is written in C or C++,

maybe I can help you!

Send it to my box:ls223224@163.com!

Re: I have solution, but I need some help.

为什么你这么叼，O（n）就解决了。？？？

Re: I have solution, but I need some help.

You know, if you'll always allocate a segment tree of size upper bound of N you will indeed acquire an O(n) solution... Although, it will be actually slower than the O(nlogn) one.

I mean, boasting about your (undescribed) O(n) is never a good thing. (And also, I wanna boast with my algorithm theory knowledge and tell you that "O(C*n).C is a constant number!" looks quite silly).