Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2) D. Volatile Kite

可单独拿一个点来看，如果要使凸包退化，即使得其与其的相邻两点变成至少三点共线，这种情况的移动最小距离是以其相邻两点为底，该点为顶点的三角形的高的一半，所以二分答案，遍历每个点求三角形的高的一半和该值作对比即可

#include<bits/stdc++.h>
using namespace std;
int n,px[1005],py[1005];
double l=0,r=1e9;
double distance(double x1,double y1,double x2,double y2)
{
    return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
double area(double x1,double y1,double x2,double y2,double x3,double y3)
{
    return fabs(x1*y2+x2*y3+x3*y1-x1*y3-x3*y2-x2*y1)/2;
}
bool check(double x)
{
    for(int i=0;i<n;i++)
    {
        double Area=area(px[(i+n-1)%n],py[(i+n-1)%n],px[i],py[i],px[(i+1)%n],py[(i+1)%n]);
        double Distance=distance(px[(i+n-1)%n],py[(i+n-1)%n],px[(i+1)%n],py[(i+1)%n]);
        if(Area/Distance<x)return 0;
    }
    return 1;
}
int main()
{
    scanf("%d",&n);
    for(int i=0;i<n;i++)scanf("%d%d",&px[i],&py[i]);
    for(int i=0;i<200;i++)
    {
        double m=(l+r)/2;
        if(check(m))l=m;
        else r=m;
    }
    printf("%.10lf",l);
    return 0;
}