 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
Re:那是所有点对间的最短距离才有鸽巢原理啊。这题voronoi图可以做，但是太麻烦了。不知道用分治算法该怎么做In Reply To:Re:那是所有点对间的最短距离才有鸽巢原理啊。这题voronoi图可以做，但是太麻烦了。不知道用分治算法该怎么做 Posted by:ACM_Hohai at 2009-01-11 16:17:02 另外，鸽巢原理是指在“所有点对”问题中，minlen*minlen的范围内最多只能有4个点，但是分成两组后minlen*minlen的范围内可以有无数个点。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
