hdu 1071 辛普森方法

来源:互联网 发布:ps淘宝修图兼职 编辑:程序博客网 时间:2024/06/05 00:18
#include<cstdio>#include<cmath>double ah,h,ch,bb,cc,k,x1,x2,yy1,y2,x3,y3;// simpson公式用到的函数double F(double x) {  return (ah*(x-h)*(x-h)+ch-(k*(x-bb)+cc));}// 三点simpson法。这里要求F是一个全局函数double simpson(double a, double b) {  double c = a + (b-a)/2;  return (F(a)+4*F(c)+F(b))*(b-a)/6;}// 自适应Simpson公式(递归过程)。已知整个区间[a,b]上的三点simpson值Adouble 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);}// 自适应Simpson公式(主过程)double asr(double a, double b, double eps) {  return asr(a, b, eps, simpson(a, b));}double solve(){    h=x1;    ch=yy1;    ah=(y3-ch)/((x3-h)*(x3-h));    k=(y3-y2)/(x3-x2);    bb=x2;    cc=y2;    return asr(x2,x3,1e-6);}int main(){    int t;    scanf("%d",&t);    while(t--)    {        double ans;        scanf("%lf%lf",&x1,&yy1);        scanf("%lf%lf",&x2,&y2);        scanf("%lf%lf",&x3,&y3);        ans=solve();        printf("%.2lf\n",ans);  }  return 0;}

原创粉丝点击