UVA 1616 - Caravan Robbers

二分找最大区间长，然后暴力搜出最优分数

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <cmath>
using namespace std;
const int maxn = 100000+10;
const double INF = 1000000.0;
const double eps = 1e-10;
int n, T;
pair<int, int> pai[maxn];

int main()
{
    while(scanf("%d", &n) != EOF) {
        for(int i = 0; i < n; ++i)
            scanf("%d%d", &pai[i].first, &pai[i].second);
        sort(pai, pai+n);
        double l = 0, r = INF;
        double ans = 0.0;
        while(l + eps <= r) {
            double mid = (l + r) / 2, v = 0;
            bool is = true;
            for(int i = 0; i < n && is; ++i) {
                if(v < pai[i].first) v = pai[i].first;
                if(v + mid > pai[i].second) is = false;
                v += mid;
            }
            if(is) {
                l = mid;
                ans = max(ans, mid);
            } else r = mid;
        }
        int rp = 0, rq = 1;
        for (int p, q = 1; q <= n; q++) {
            p = round(ans * q);
            if (fabs((double)p / q - ans) < fabs((double)rp / rq - ans)) {
                rp = p;
                rq = q;
            }
        }
        printf("%d/%d\n", rp, rq);
    }
    return 0;
}