jzoj4033 [GCJ2009B] Min Perimeter 分治

Description

---

给你一个整数坐标的点集，询问点集中最小的三角形周长是多少。退化的三角形也是允许的(面积为0)。

0< n<=100000

Solution

---

和平面最近点对类似，分治过后枚举跨过中心的三个点。加上一些优化就A了

Code

---

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
#define drp(i,st,ed) for (int i=st;i>=ed;--i)
#define sqr(x) ((x)*(x))
#define fi first
#define se second

typedef std:: pair <int,int> pair;
typedef double db;
const int INF=1e9;
const int N=200005;

pair p[N];

db get_dis(pair a,pair b) {
    return sqrt(sqr(a.fi-b.fi)+sqr(a.se-b.se));
}

db get_C(pair a,pair b,pair c) {
    return get_dis(a,b)+get_dis(a,c)+get_dis(b,c);
}

db solve(int l,int r) {
    if (r-l<=1) return INF;
    if (r-l==2) return get_C(p[l],p[l+1],p[r]);
    int mid=(l+r)/2;
    db ret=std:: min(solve(l,mid),solve(mid,r));
    drp(i,mid,l) {
        if (get_dis(p[i],p[mid])>=ret) break;
        rep(j,mid,r) {
            if (get_dis(p[i],p[j])>=ret) break;
            rep(k,i,j) {
                if (i==j||i==k||j==k) continue;
                ret=std:: min(ret,get_C(p[i],p[j],p[k]));
            }
        }
    }
    return ret;
}

int main(void) {
    freopen("data.in","r",stdin);
    int n; scanf("%d",&n);
    rep(i,1,n) scanf("%d%d",&p[i].fi,&p[i].se);
    std:: sort(p+1,p+n+1);
    printf("%.8lf\n", solve(1,n));
    return 0;
}