BZOJ2178: 圆的面积并

sort区间求贡献
和之前那一题差不多

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<set>
#include<cmath>
using namespace std;
const
 int MAXN=1050;
const
 double eps=1e-8;
int n; 
struct Point{double x,y;};
struct Circle
{Point o;double r;}C[MAXN];
struct Rec{double l,r;inline friend bool operator <(Rec a,Rec b){return a.l<b.l;}};
Rec S[10001];
int Con=0;
#define abs(a) ((a)<0?(-(a)):(a))
inline double D(double x)
{
    int flag=-1,Ss=0;
    double d,ans=0;
    for(int i=1;i<=n;i++)
    {
      Rec L,H;
      double t=C[i].r*C[i].r-(C[i].o.x-x)*(C[i].o.x-x);
      if(t<0)continue;
      t=sqrt(t);
      L.l=C[i].o.y-t;
      L.r=C[i].o.y+t;
      S[++Ss]=L;
    }
    int j;
    sort(S+1,S+1+Ss);
    for(int i=1;i<=Ss;i++)
    {
        double r=S[i].r;
        for(j=i+1;j<=Ss;j++)
             {if(S[j].l>r)break;
              if(r<S[j].r)r=S[j].r;}
      ans+=r-S[i].l;i=j-1;
    }
    return ans;
}
#define Calc(a,b,c,d) (((b)+4*(c)+(d))*(a)/6)
double Simpson(double L,double M,double R,double fL,double fM,double fR,double sqr)
{
    double Mid1=(L+M)/2,Mid2=(M+R)/2,D1=D(Mid1),D2=D(Mid2),Area1=Calc(M-L,fL,D1,fM),Area2=Calc(R-M,fM,D2,fR);
    if(abs(Area1+Area2-sqr)<eps) return Area1+Area2;
    return Simpson(L,Mid1,M,fL,D1,fM,Area1)+Simpson(M,Mid2,R,fM,D2,fR,Area2);
}

char c;
bool flag;
inline void read(int &a)
{
    a=0;do c=getchar();while((c<'0'||c>'9')&&c!='-');
    if(c=='-')c=getchar(),flag=true;
    while(c<='9'&&c>='0')a=(a<<3)+(a<<1)+c-'0',c=getchar();
    if(flag)flag=false,a=-a;
}

int main()
{

    int x,r,y;
    double Min=1<<29,Max=-Min,d,h,Ang,Sin,Cos;
    read(n);
    for(int i=1;i<=n;i++) 
        {
         read(x),read(y),read(r);
         C[i]=(Circle){(Point){x,y},r};
        }
    double L=-2000,R=2000;
    double M=(L+R)/2;
    double fL=D(L),fM=D(M),fR=D(R);
    printf("%.3lf\n",Simpson(L,M,R,fL,fM,fR,Calc(R-L,fL,fM,fR)));
    return 0;
}