题目大意
给定一些圆和梯形,求它们面积的并
解答
直接用辛普森公式积分
∫baf(x)×dx≈b−a6[f(a)+f(a+b2)+f(b)]
由于辛普森公式对于4次及以上的函数误差比较大,所以可以二分,当满足
|Simpson(a,b)−Simpson(a,a+b2)−Simpson(a+b2,b)|≤eps
时就可以近似认为Simpson求出的值是正确值。
f(x)只要预处理一下就可以出来,首先将所有的高度乘上 cot(α) ,然后求相邻两个不套在一起的圆的公切线:
sinA=BD−CEBCD(B.x+BD×sinA,BD×cosA)
参考代码
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <algorithm>
using namespace std;
const double eps = 1e-8;
class Line
{
public:
double x1, y1, x2, y2;
};
int n;
double alpha;
double h[800];
double r[800];
double ll = 0, rr = 0;
Line ls[1600];
int lt = 0;
inline double sqr(double x)
{
return x*x;
}
void readin()
{
scanf("%d %lf", &n, &alpha);
double tmp = 1/tan(alpha);
double x;
for (int i = 0; i <= n; i++) {
scanf("%lf", &x);
x *= tmp;
h[i] = x + (i ? h[i-1] : 0);
}
for (int i = 0; i < n; i++) {
scanf("%lf", &r[i]);
ll = min(ll, h[i]-r[i]);
rr = max(rr, h[i]+r[i]);
}
r[n] = 0;
rr = max(rr, h[n]);
}
void preWork()
{
double d;
for (int i = 0; i < n; i++) {
d = h[i+1]-h[i];
if (d > fabs(r[i+1]-r[i])) {
double sinbeta = (r[i]-r[i+1])/d;
double cosbeta = sqrt(1-sqr(sinbeta));
ls[lt].x1 = h[i]+r[i]*sinbeta;
ls[lt].y1 = r[i]*cosbeta;
ls[lt].x2 = h[i+1]+r[i+1]*sinbeta;
ls[lt++].y2 = r[i+1]*cosbeta;
}
}
}
double f(double l)
{
double ret = 0;
for (int i = 0; i < n; i++) {
if (fabs(h[i]-l) < r[i])
ret = max(ret, sqrt(sqr(r[i])-sqr(h[i]-l)));
}
for (int i = 0; i < lt; i++) {
if (ls[i].x1 < l && ls[i].x2 > l) {
double k = (ls[i].y2-ls[i].y1) / (ls[i].x2-ls[i].x1);
ret = max(ret, ls[i].y1+k*(l-ls[i].x1));
}
}
return ret;
}
double simpson(double lp, double rp)
{
double mid = (lp+rp)/2;
return (rp-lp)*(f(lp)+4*f(mid)+f(rp))/6;
}
double work(double lp, double rp)
{
double mid = (lp+rp)/2;
double cmp = simpson(lp, mid) + simpson(mid, rp);
double cmp1 = simpson(lp, rp);
if (fabs(cmp1-cmp) < eps)
return cmp;
return work(lp, mid) + work(mid, rp);
}
int main()
{
readin();
preWork();
printf("%.2lf", work(ll, rr)*2);
return 0;
}