poj 1328 greedy

       区间贪心，水题，将能扫描到小岛的雷达区间全部求出后排序，求最少互不相交的集合数。

       代码如下：

 

#include <cstdio>
#include <stack>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <list>
#include <functional>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <iomanip>
#include <cmath>
#define LL long long
#define ULL unsigned long long
#define SZ(x) (int)x.size()
#define Lowbit(x) ((x) & (-x))
#define MP(a, b) make_pair(a, b)
#define MS(arr, num) memset(arr, num, sizeof(arr))
#define PB push_back
#define F first
#define S second
#define ROP freopen("input.txt", "r", stdin);
#define MID(a, b) (a + ((b - a) >> 1))
#define LC rt << 1, l, mid
#define RC rt << 1|1, mid + 1, r
#define LRT rt << 1
#define RRT rt << 1|1
#define BitCount(x) __builtin_popcount(x)
#define BitCountll(x) __builtin_popcountll(x)
#define LeftPos(x) 32 - __builtin_clz(x) - 1
#define LeftPosll(x) 64 - __builtin_clzll(x) - 1
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
using namespace std;
const double eps = 1e-5;
const int MAXN = 300 + 10;
const int MOD = 1000007;
const double M=1e-8;
const int N=1e3+10;
typedef pair<int, int> pii;
typedef pair<int, string> pis;
const int d[4][2]={{0,1},{0,-1},{-1,0},{1,0}};
int n,m,ans;
struct node
{
    double l,r;
};
node a[N];
bool cmp(const node a,const node b)
{
     return  fabs(a.l-b.l)<M?a.r<b.r:a.l<b.l;
}
int main()
{
    int i,j,d,k=1;
    bool vis[N];
    while(~scanf("%d%d",&n,&d),n)
    {
        int flag=0;
        MS(vis,false);
        for (i=0;i<n;i++) {
            int x,y;
            scanf("%d%d",&x,&y); //printf("coord=%d %d\n",x,y);
            if (y>d) flag=1;
            double dis=sqrt(d*d*1.0-y*y);
            a[i].l=x-dis;
            a[i].r=x+dis;
        }
        if (flag) {
            printf("Case %d: -1\n",k++);
            getchar();
            continue;
        }
        double pos,temp;
        int cnt=1;
        sort(a,a+n,cmp);
        for (i=0,temp=a[0].r;i<n;i++) {    //printf("%.1llf %.1llf\n",a[i].l,a[i].r);
            if (i+1<n && a[i+1].l>temp) {
                temp=a[i+1].r;
                cnt++;
            }
            else if (i+1<n && a[i+1].r<temp) temp=a[i+1].r;
         }
        printf("Case %d: %d\n",k++,cnt);
        getchar();
    }
}