[algogeeks] Re: Circle Arrangement Problem

2006-12-08 Thread Robby
To ZhenLiangSC: I am afraid not. If a person is removed, he won't be counted after that. ps. The best algorithm I can find is O(NlogN), by employing an interval tree or something like that. Sorry for my poor English, too... :) [EMAIL PROTECTED] 写道: first put f to the temp=k-th

[algogeeks] Re: Circle Arrangement Problem

2006-12-08 Thread Zhen Liang
ho,sorry for mistaking the meaning of subject. 在06-12-9,Robby [EMAIL PROTECTED] 写道: To ZhenLiangSC: I am afraid not. If a person is removed, he won't be counted after that. ps. The best algorithm I can find is O(NlogN), by employing an interval tree or something like that. Sorry for