You can use interval tree to reduce the time complexity to O(nlogn)cauchy wrote:Is it possible to get O(nlogn) for this problem? I got acc but my program runs extreamly slow (nearly 5sec) and I have only O(n^2). I would be grateful for any hint
Search found 1 match
- Tue May 25, 2004 3:47 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10535 - Shooter
- Replies: 25
- Views: 56363
