单位圆覆盖

计算几何什么的最恶心了。。

 

 

求半径为1的圆覆盖最多的点

 

可以知道在交点上可以覆盖得最多。。圆之间的并。- -|

 

所以枚举两个圆。。求交点作为圆心

这题我一开始用pascal写了个n^3的。。tle

用c写了-= -。。在poj上ac了 = =结果八中oj..tle、、囧。。

 

所以写了n^2logn的

 

n^2logn的就是算出被覆盖最多的弧- -在每个圆上划分弧- -，，

 

n^2logn的

#include <iostream> #include<cmath> #define pi 3.14159526535897932 #define zero 0.000000001 using namespace std; struct point {double x,y;}; double d[700]; int len,g[700]; double dis(point i, point j) { return ((i.x-j.x)*(i.x-j.x)+(i.y-j.y)*(i.y-j.y)); } double get(double x,double y) { if (abs(x) <= zero) {if (y>=zero) return pi/2; else return pi/2*3; } else if (abs(y)<=zero) {if (x>=zero) return 0; else return pi; } else if (x>=zero && y>=zero) return atan(y/x); else if (x<=-zero && y>=zero) return (pi-atan(-y/x)); else if(x<=-zero && y<=-zero) return (pi+atan(y/x)); else return (2*pi-atan(-y/x)); } void cot(double x,double y) { len++; d[len] = x; g[len] = 1; len++; d[len] = y; g[len] = -1; } void put(double x,double y) { if (x>=zero && y<=2*pi) { cot(x,y); } else if (x<=-zero) { cot(0,y); cot(x+2*pi,pi); } else if (y>2*pi) { cot(0,y-2*pi); cot(x,2*pi); } } bool same(double x,double y) { if (abs(x-y)<=zero) return true; else return false; } void kqsort(int l,int r) { int i=l,j=r,midg=g[(l+r)>>1]; double midd=d[(l+r)>>1]; do { while ((d[i]<midd) || (d[i]==midd && g[i]>midg) ) i++; while ((midd<d[j]) || (d[j]==midd && g[j]<midg) ) j--; if (i<=j) { swap(d[i],d[j]); swap(g[i],g[j]); i++;j--; } }while (i<=j); if (l<j) kqsort(l,j); if (i<r) kqsort(i,r); } int main() { point p[301],tmp; int ans,n,res; scanf("%d",&n); while (n) { ans = 1; for (int i=0;i<n;i++) scanf("%lf%lf",&p[i].x,&p[i].y); for (int i=0;i<n;i++) { len=-1; for (int j=0;j<n;j++) if (i!=j) { double d = sqrt(dis(p[i],p[j]))/2; if (d>1) continue; double arc = get (p[j].x-p[i].x, p[j].y-p[i].y); double add = atan(sqrt(1-d*d)/d); put(arc-add,arc+add); } kqsort(0,len); res=1; for (int j=0;j<=len;j++) { res += g[j]; ans= ans > res ? ans : res; } } printf("%d/n",ans); scanf("%d",&n); } }

 

n^3

#include <iostream> #include <cmath> using namespace std; #define REP(i,a) for(int i=0;i<a;i++) struct point {double x,y;}; point t1; double dis(point i, point j) { return ((i.x-j.x)*(i.x-j.x)+(i.y-j.y)*(i.y-j.y)); } void count (point i, point j) { double a=2*(j.x-i.x); double b=2*(j.y-i.y); double c=j.x * j.x-i.x*i.x+j.y*j.y-i.y*i.y; if ( (abs(a)) <= (0.00001)) { t1.y=c/b; t1.x=i.x+sqrt(1-(t1.y-i.y)*(t1.y-i.y)); } else if (abs(b)<=0.00001) { t1.x=c/a; t1.y=i.y+sqrt(1-(t1.x-i.x)*(t1.x-i.x)); } else { double p=c/a-i.x; double q=b/a; double aa=q*q+1; double bb=-2*p*q-2*i.y; double cc=i.y*i.y+p*p-1; t1.y=(-bb+sqrt(bb*bb-4*aa*cc))/(2*aa); t1.x=(c-b*t1.y)/a; } } int main() { point p[301],tmp; int ans,n,res; scanf("%d",&n); while (n) { ans = 1; for (int i=0;i<n;i++) scanf("%lf%lf",&p[i].x,&p[i].y); for (int i=0;i<n;i++) for (int j=i+1;j<n;j++) if (dis(p[i],p[j]) <=4 ) { count (p[i],p[j]); res=0; REP(k,n) if (dis(p[k],t1)<=1.000001 ) res++; ans = ans > res ? ans :res; } printf("%d/n",ans); scanf("%d",&n); } }