Nyoj 12 喷水装置（二）

题目来源：http://acm.nyist.net/JudgeOnline/problem.php?pid=12

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;

const int MAXN = 10010;

struct Tap_News
{
    double iLeft;
    double iRight;
    Tap_News()
    {
        iLeft = 0;
        iRight = 0;
    }
}Tap[MAXN];


bool cmp(Tap_News a, Tap_News b)
{
    return a.iLeft < b.iLeft ? true : false;
}

int main()
{
    int T, n, i, k, ans;
    double w, h, Len, Max_Len, y, tmp, x, r;

    scanf("%d", &T);
    while(T--)
    {
        scanf("%d %lf %lf", &n, &w, &h);
        tmp = h*h/4.0;
        y = h/2.0;
        k = 0;
        for(i = 0; i < n; ++i)
        {
            scanf("%lf %lf", &x, &r);
            if(r <= y)
                continue;
            Tap[k].iLeft = x - sqrt(r*r - tmp);
            Tap[k++].iRight = x + sqrt(r*r - tmp);
        }

        sort(Tap, Tap+k, cmp);
        bool flag = false;
        ans = 0, Len = 0;
        while(Len < w)
        {
            Max_Len = 0;
            for(i = 0; i < k; ++i)//寻找覆盖半径最大的水龙头
            {
                if(Tap[i].iLeft <= Len && Tap[i].iRight - Len > Max_Len)//第一个条件是必要的！
                    Max_Len = Tap[i].iRight - Len;
            }

            if(!Max_Len)
            {
                flag = true;
                break;
            }
            ans++;
            Len += Max_Len;
        }
        if(flag)
        {
            printf("0\n");
            continue ;
        }
        printf("%d\n", ans);
    }
}