Page 2 of 2
Posted: Sun Feb 20, 2005 5:02 pm
by Destination Goa
Ok.
Posted: Sun Feb 20, 2005 5:03 pm
by Destination Goa
I guess it depends on coordinate limits, right? like log(DX) * log(DY)
DX=MAXX-MINX, DY=MAXY-MINY
If so, then it's actually O(N*log(DX)*log(DY)) for arbitrary values of X/Y fitting into 'long double' without precision issues. Might be O(N*log(N)) if we can compact space between neighboring X/Y values.
I'll know when I find it
Posted: Sun Nov 19, 2006 3:39 am
by sclo
I implemented my algorithm in 40 lines, and it's O((log X)*(n log n))
using stl. I can make it faster, but it's not needed to get AC.
Re: 10797 - Peaceful Sharing
Posted: Mon Oct 20, 2008 8:46 pm
by phy
Could someone explain or introduce something about the term "dual" or "median of arrangement"?
This problem looks interesting. But I just got no idea on solving this...
Thanks in advance.