三分模板以LibreOJ10013曲线为例
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=1e4+10;
const double eps=1e-9;
int t,n;
struct curve{
double a,b,c;
}c[N];
double getans(int i,double x)
{
return c[i].a*x*x+c[i].b*x+c[i].c;
}
double getmax(double x)
{
double ans=-0x7fffffff;
for(int i=1;i<=n;i++)ans=max(ans,getans(i,x));
return ans;
}
int main()
{
//freopen("in.txt","r",stdin);
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%lf%lf%lf",&c[i].a,&c[i].b,&c[i].c);
double l=0,r=1000,mid,mmid,maxm,maxmm;
while(r-l>eps)
{
mid=(l+r)/2;
mmid=(mid+r)/2;
maxm=getmax(mid);
maxmm=getmax(mmid);
if(maxm<maxmm)r=mmid;
else l=mid;
}
printf("%.4f\n",maxm);
}
return 0;
}