先把所有曲线的交点(加上0.0和100.0)都找出来,排个序,然后相邻的两个节点用辛普森自适应积分求出,当然要先求出此时对应的最小值函数,只需要取这一段的中点m,求出哪条曲线使ki * (x - ai) * (x - ai) + bi最小(扫一遍),那么这一段对应的最小值函数就是这个曲线。
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <cstring>
using namespace std;
int A[55],B[55],k[55];
//simpson
int low;
#define mpow(X) ((X)*(X))
double F(double x)
{return sqrt(1.0+mpow(2.0*k[low]*x+1.0*A[low])); }
double simpson(double a,double b)
{return (F(a)+4*F(a+(b-a)/2.0)+F(b))*(b-a)/6.0;}
double asr(double a,double b,double eps,double A)
{
double c=a+(b-a)/2.0;
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.0,L)+asr(c,b,eps/2.0,R);
}
vector<double> v;
typedef long long LL;
void push(double t)
{if(t>0.0&&t<100.0) v.push_back(t);}
void add(int a,int b,int c)
{
if(a==0){
if(b) push((double)c/(double)b);
return;
}
LL delta=(LL)b*b-4ll*a*c;
if(delta<0ll) return;
if(delta==0ll) push(-(double)b/2.0/a);
else push((-(double)b+sqrt((double)delta))/2.0/a),
push((-(double)b-sqrt((double)delta))/2.0/a);
}
int main(void)
{
int t;
scanf("%d",&t);
while(t--){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",k+i,A+i,B+i);
B[i] = k[i]*A[i]*A[i]+B[i];
A[i] = -2*k[i]*A[i];
}
k[0]=A[0]=0,B[0]=100;//补充f0=100;
v.clear();
for(int i=0;i<n;i++)
for(int j=i+1;j<=n;j++)
add(k[i]-k[j],A[i]-A[j],B[i]-B[j]);
v.push_back(0.0);
v.push_back(100.0);
sort(v.begin(),v.end());
int sz=v.size();
double curve=0,eps=1e-7;
for(int i=0;i<sz-1;i++)
{
if(fabs(v[i+1]-v[i])<eps) continue;
double mid=(v[i]+v[i+1])/2.0,lowval;
low=0,lowval=k[low]*mid*mid+A[low]*mid+B[low];
for(int j=1;j<=n;j++)
{
double tmp=k[j]*mid*mid+A[j]*mid+B[j];
if(tmp<lowval) lowval=tmp,low=j;
}
curve+=asr(v[i],v[i+1],eps,simpson(v[i],v[i+1]));
}
printf("%.2f\n",curve );
}
return 0;
}