POJ 2966 k-d Tree

  题意：二维平面中有n个点，求每个点和其他点的最远距离   #include<stdio.h> #include<iostream> #include<string.h> #include<algorithm> using namespace std; #define ll long long const int maxm = 100005; const ll INF = 1e18; struc

>>阅读原文<<