最近点对
SandraOvO
这个作者很懒,什么都没留下…
展开
-
HDU 1007 Quoit Design
Description Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded. In the field of Cyberground, the positio原创 2016-05-15 20:45:07 · 170 阅读 · 0 评论 -
UVA 10245 The Closest Pair Problem
n=1的情况要注意~ #include #include #include #include #include using namespace std; const int maxn = 10060; // 分治算法求最近点对 struct point//保存每一个点 { double x,y; }p[maxn]; int a[maxn];//保存筛选的坐标点的索引即2min(dl,原创 2016-05-15 20:46:16 · 228 阅读 · 0 评论 -
POJ 3714 Raid
Description After successive failures in the battles against the Union, the Empire retreated to its last stronghold. Depending on its powerful defense system, the Empire repelled the six waves of原创 2016-05-15 21:48:03 · 377 阅读 · 0 评论