POJ 1328 "Radar Installation"

一道贪心算法的题目，wa了N次，最后发现是数据精度的问题，改用float终于ac。#include <cstdlib> #include <cstring> #include <cstdio> #include <cmath> #include <algorithm> using namespace std; struct region { float left; float right; }array[1000] = {0}; int cmp(const void* l, const void* r) { struct region *L = (struct region*)l; struct region *R = (struct region*)r; return L->left<R->left || (L->left==R->left && L->right < R->right) ? -1 : 1; } int caseNum = 1; int main () { //memset(region, 0, sizeof(region)); int n, d, cnt, i, flag; float x, y; while (scanf("%d%d", &n, &d) != EOF) { if (n == 0 && d == 0) break; i = 0; flag = 1; while (i != n) { scanf("%f%f", &x, &y); if (y > d) { flag = 0; } array[i].left = x - sqrt(d*d - y*y); array[i].right = x + sqrt(d*d - y*y); i++; } if (flag) { cnt = 1; qsort(array, n, sizeof(struct region), cmp); int index = 1; struct region tempRegion = array[0]; while (index < n) { if (tempRegion.right < array[index].left) { tempRegion.left = array[index].left; tempRegion.right = array[index].right; cnt++; } else { tempRegion.left = max(tempRegion.left, array[index].left); tempRegion.right = min(tempRegion.right, array[index].right); } index++; } } else cnt = -1; printf("Case %d: %d/n", caseNum++, cnt); } return 0; } 思路：每一个island都对应一个区间，在这个区间内的radar都可以覆盖这个island，求出所有island的区间并且排序（这里按照左边界排序和右边界排序貌似对结果来说都一样）。然后遍历区间，讲radar尽可能的放在右边，直到出现两个区间没有交集。然后从这个没有交集的新区间开始，继续尽可能靠右的添加radar。