自适应辛普森法

证明省略

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
#include<cstdio>
#include<cmath>
using namespace std;
const double eps=1e-10;
double a,b,c,d;
double F(double x)
{
return (c*x+d)/(a*x+b);
}
double simpson(double l,double r)
{
double mid=(l+r)/2.0;
return (F(l)+F(mid)*4.0+F(r))*(r-l)/6.0;
}
double ASR(double l,double r,double ans)
{
double mid=(l+r)/2.0;
double L=simpson(l,mid);
double R=simpson(mid,r);
if (fabs(L+R-ans)<eps)
return ans;
else
return ASR(l,mid,L)+ASR(mid,r,R);
}
int main()
{
double ql,qr;
scanf("%lf%lf%lf%lf",&a,&b,&c,&d);
scanf("%lf%lf",&ql,&qr);
printf("%.6lf",ASR(ql,qr,simpson(ql,qr)));
return 0;
}