UVA 1616 Caravan Robbers （暴力 + 二分）

思路：
二分法 + 暴力
由于每个区间长度相同，所以对单位长度的区间必然最多被分为n份。
这也就使得暴力枚举分母成为可能。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>

using namespace std;

const int maxn = 1e5 + 5;
const double inf = 1e6 + 5;
typedef long long ll;
//using ll = long long;

struct Node {
    double l, r;
    bool operator<(const Node &rhs) const {
        return l < rhs.l || (l == rhs.l && r < rhs.r);
    }
}a[maxn];
int n;

bool check(double mid) {
    double cur = a[0].l;
    for(int i = 0; i < n; ++i) {
        if(cur < a[i].l) cur = a[i].l;
        if(cur + mid > a[i].r) return false;
        cur += mid;
    }
    return true;
}

int main() {
/*
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
*/
    while(cin >> n) {
        for(int i = 0; i < n; ++i)
            scanf("%lf%lf", &a[i].l, &a[i].r);
        sort(a, a + n);

        double low = 0, high = inf, mid;
        for(int i = 0; i < 100; ++i) {
            mid = (low + high) / 2;
            if(check(mid)) low = mid;
            else high = mid;
            //printf("l = %lf, mid = %lf, r = %lf\n", low, mid, high);
        }

        ll num = 0, den = 1;
        for(int tden = 1; tden <= n; ++tden) {
            ll tnum = round(mid * tden);
            if(fabs((double)tnum/tden - mid) < fabs((double)num/den - mid))
                num = tnum, den = tden;
        }

        printf("%lld/%lld\n", num, den);
    }
    return 0;
}