自适应辛普森算法的代码实现

最新推荐文章于 2023-09-02 23:15:45 发布

yypSandra

最新推荐文章于 2023-09-02 23:15:45 发布

阅读量315

点赞数

原文链接：https://blog.csdn.net/weixin_45483201/article/details/108469343

版权

#include <iostream>

using namespace std;

typedef long long ll;

const int inf = 0x3f3f3f3f;
const double eps = 1e-6;

double a, b, c, d, l, r;

// 要进行积分的原函数
double f(double x) {
    return ;
}

//计算辛普森积分
double sim(double l, double r) {
    return (r - l) * (f(l) + f(r) + 4.0 * f((l + r) / 2.0)) / 6.0;
}

double asr(double l, double r,double ans) {

    double mid = (l + r) / 2;
    
    double ansl = sim(l, mid), ansr = sim(mid, r);
    
    if(fabs(ansl + ansr - ans) < eps) return ansl + ansr;

    return asr(l, mid,  ansl) + asr(mid, r,ansr);
}

int main() {
    scanf("%lf %lf %lf %lf %lf %lf", &a, &b, &c, &d, &l, &r);
    printf("%.6f\n", asr(l, r, sim(l, r)));
	return 0;
}