题目要求在y=0上找一个点,使得所有村庄点到这个点的最远距离最小。
y=0,这条线从左往右走,会发现距离是先减少后增加,是一个向下凸的函数。所以用三分。
AC代码
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const int mod = 998244353;
const int N = 5e4+10;
int n;
struct Node{
double x,y;
}node[N];
#define C(x) ((x)*(x))
double check(double &x){
double ma = -INF;
for(int i=1;i<=n;i++) ma = max(C(node[i].x-x)+C(node[i].y),ma);
return ma;
}
signed main(){
// IOS
#ifdef ddgo
freopen("C:\\Users\\asus\\Desktop\\ddgoin.txt","r",stdin);
#endif
while(scanf("%lld",&n) !=EOF && n){
double l = INF,r = -INF;
for(int i=1;i<=n;i++){
double a,b; scanf("%lf %lf",&a,&b);
node[i] = {a,b};
l = min(l,a);
r = max(r,a);
}
while(r - l > eps){
double mid1 = l + (r-l)/3;
double mid2 = r - (r-l)/3;
if(check(mid1) > check(mid2)) l = mid1;
else r = mid2;
}
printf("%.9lf %.9lf\n",l,sqrt(check(l)));
}
return 0;
}
区别代码(仅此一处不同,这个wa,玄学)
if(check(mid1) - check(mid2) > eps) l = mid1;
else r = mid2;