# User talk:Darwish

Thanks for contributing! I don't think you can do better than ${\displaystyle O(n\log n)}$ though. People on the UVa leaderboards usually optimize for I/O! Larry 17:46, 24 March 2010 (UTC)
Thanks for the encouragement! It seems yes, no one has done better than ${\displaystyle O(n\log n)}$ on the boards; after small modifications to code (without optimizing I/O), I was able to get a rank!