自适应Simpson积分（近似求积分）

来自 http://blog.csdn.net/xiaosshhaa/article/details/70799670
//1261: 地狱飞龙 
#include <bits/stdc++.h>
using namespace std;
const double eps=1e-7;
double v1,v2,x,k;
int t;
//积分函数
double F(double t)
{
    return  k/((x-v2*t)*(x-v2*t)+(v1*t)*(v1*t));
}
//自适应Simpson积分
double simpson(double a,double b)
{
    double c=a+(b-a)/2;
    return (F(a)+4*F(c)+F(b))*(b-a)/6;
}
double asr(double a,double b,double eps,double A)
{
    double c=a+(b-a)/2;
    double L=simpson(a,c),R=simpson(c,b);
    if(fabs(L+R-A)<=15*eps) return L+R+(L+R-A)/15.0;
    return asr(a,c,eps/2,L)+asr(c,b,eps/2,R);
}

double asr(double a,double b,double eps)
{
    return asr(a,b,eps,simpson(a,b));
}

int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lf%lf%lf%lf",&v1,&v2,&x,&k);
        printf("%.2f\n", asr(0,10000000,eps));
    }
    return 0;
}