hdu 3847 Trash Removal

凸包题目：
先把凸包求出来，那么要计算的点必然在凸包所构成的多边形边界上，在边界上枚举每条边，求得其所有点相对于这条边的最大距离，
然后取这些最大距离的最小的一个就可以了，对了，这题目要求向上取整
#include <iostream>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <set>
#include <vector>
#include <cstring>
#include <algorithm>

#define INF 0x3fffffff
#define N 100
#define M 1000010
#define LL long long
#define mod 95041567

using namespace std;

struct Point{
    int x, y;
    Point (int a = 0, int b = 0):x(a), y(b) { }
    bool operator < (const Point &p) const{
        if(x != p.x) return x < p.x;
        return y < p.y;
    }
};

Point operator - (Point a, Point b){
    return Point(a.x - b.x, a.y - b.y);
}

Point p[N + 10];
Point v[N + 10];

int Cross(Point a, Point b){
    return a.x * b.y - a.y * b.x;
}

double Length(Point a){
    return sqrt(1.0 * a.x * a.x + a.y * a.y);
}

double DistanceToLine(Point arg, Point a, Point b){
    Point v1 = b - a, v2 = arg - a;
    return fabs(Cross(v1, v2) * 1.0) / Length(v1);
}

int ConvexHull(int n){
    sort(p, p + n);
    int m = 0;
    for(int i = 0; i < n; ++ i){
        while(m > 1 && Cross(v[m - 1] - v[m - 2], p[i] - v[m - 2]) <= 0) -- m;
        v[m ++] = p[i];
    }
    int k = m;
    for(int i = n - 2; i >= 0; -- i){
        while(m > k && Cross(v[m - 1] - v[m - 2], p[i] - v[m - 2]) <= 0) -- m;
        v[m ++] = p[i];
    }
    return m;
}

double solve(int m){
    double c = INF;
    for(int i = 0; i < m; i += 2){
        double d = 0, e = 0;
        for(int j = 0; j < m; ++ j){
            int l = (i - 1 + m) % m, r = (i + 1) % m;
            if(j != i && j != l) e = max(e, DistanceToLine(v[j], v[l], v[i]));
            if(j != i && j != r) d = max(d, DistanceToLine(v[j], v[i], v[r]));
        }
        c = min(c, d);
        c = min(c, e);
    }
    return c;
}

int main()
{
   // freopen("in.txt","r",stdin);
    int n, t = 0;
    while(scanf("%d", &n) != EOF){
        if(! n) break;
        for(int i = 0; i < n; ++ i)
            scanf("%d %d", &p[i].x, &p[i].y);
        int m = ConvexHull(n);
        double c = solve(m - 1);
        c = ceil(c * 100) / 100.0;
        printf("Case %d: %.2lf\n", ++ t, c);
    }
    return 0;
}