</pre><span style="font-size:24px;">分析(吐槽):</span><p></p><p><span style="font-size:18px">很多种分类吧,用求倒的方法貌似被卡到精度死活也解不出来了T T</span></p><p><span style="font-size:18px">还好我第一次就是用的分离变量。</span></p><p><span style="font-size:18px">第一次写的非常非常抽(丑),对于挖点需要分析非常多的可能,后来换了一种写法就减少到100行内;</span></p><p><span style="font-size:18px">有几种特别的情况注意到就好了:</span></p><p><span style="font-size:18px">1.分解到双勾函数的时候注意那个系数的正负</span></p><p><span style="font-size:18px">2.双勾函数的两个的极值点的大小关系,这和最后区间的左右有关系,还有就是他们的正负要分5类。</span></p><p><span style="font-size:18px">3.注意正负的时候的区间左右大小关系还有是不是在0的地方合并起来。</span></p><p><span style="font-size:18px">4.注意换成双勾函数时除掉的那个分子是不是和分母同零点。用洛必达法则求极限值~</span></p><p><span style="font-size:24px">AC代码:</span></p><p><span style="font-size:18px">满意版:</span></p><p><span style="font-size:18px"></span></p><pre name="code" class="cpp">#include <cstdio>
#include <cstring>
#include<cmath>
using namespace std;
const double eps=1e-8;
double a,b,c,d,e;
int T;
int dlcmp(double x)
{
return x<-eps?-1:x>eps;
}
int main()
{
//freopen("in","r",stdin);
scanf("%d",&T);
while(T--)
{
scanf("%lf %lf %lf %lf %lf",&a,&b,&c,&d,&e);
if(dlcmp(b-a*d)==0)
{
double t=a+(c-a*e)/(e-d*d/4.0);
if(dlcmp(c-a*e)==0) {printf("[%.4f, %.4f]\n",a,a);continue;}
else if(dlcmp(e-d*d/4.0)>0)
{
if(dlcmp(c-a*e)>0) {printf("(%.4f, %.4f]\n",a,t);continue;}
else {printf("[%.4f, %.4f)\n",t,a);continue;}
}
else if(dlcmp(e-d*d/4.0)<0)
{
if(dlcmp(c-a*e)>0) {printf("(-INF, %.4f] U (%.4f, INF)\n",t,a);continue;}
else {printf("(-INF, %.4f) U [%.4f, INF)\n",a,t);continue;}
}
else
{
if(dlcmp(c-a*e)>0) {printf("(%.4f, INF)\n",a);continue;}
else {printf("(-INF, %.4f)\n",a);continue;}
}
}
else
{
double x1=(a*e-c)/(b-a*d),x2=-d-x1;
if(dlcmp(x1*x1+d*x1+e)==0)
{
double t=a+(b-a*d)/(2*x1+d);
if(dlcmp(x1-x2)==0) {printf("(-INF, %.4f) U (%.4f, INF)\n",a,a);continue;}
else if(dlcmp(a-t)<0) {printf("(-INF, %.4f) U (%.4f, %.4f) U (%.4f, INF)\n",a,a,t,t);continue;}
else {printf("(-INF, %.4f) U (%.4f, %.4f) U (%.4f, INF)\n",t,t,a,a);continue;}
}
else
{
double t1=(c-a*e)*(c-a*e)/(b-a*d)/(b-a*d)-d*(c-a*e)/(b-a*d)+e;
double t2=d-2*(c-a*e)/(b-a*d);
double p=2*sqrt(t1)+t2,q=-2*sqrt(t1)+t2;
double ans1=a+(b-a*d)/p,ans2=a+(b-a*d)/q;
if(dlcmp(t1)>0)
{
if(dlcmp(b-a*d)>0)
{
if(dlcmp(p)<0) {printf("(-INF, %.4f] U [%.4f, INF)\n",ans1,ans2);continue;}
else if(dlcmp(p)==0) {printf("[%.4f, INF)\n",ans2);continue;}
else if(dlcmp(p)>0 && dlcmp(q)<0) {printf("[%.4f, %.4f]\n",ans2,ans1);continue;}
else if(dlcmp(p)>0 && dlcmp(q)==0) {printf("(-INF, %.4f]\n",ans1);continue;}
else {printf("(-INF, %.4f] U [%.4f, INF)\n",ans1,ans2);continue;}
}
else
{
if(dlcmp(p)<0) {printf("(-INF, %.4f] U [%.4f, INF)\n",ans2,ans1);continue;}
else if(dlcmp(p)==0) {printf("(-INF, %.4f]\n",ans2);continue;}
else if(dlcmp(p)>0 && dlcmp(q)<0) {printf("[%.4f, %.4f]\n",ans1,ans2);continue;}
else if(dlcmp(p)>0 && dlcmp(q)==0) {printf("[%.4f, INF)\n",ans1);continue;}
else {printf("(-INF, %.4f] U [%.4f, INF)\n",ans2,ans1);continue;}
}
}
else if(dlcmp(t1)==0)
{
printf("(-INF, %.4f) U (%.4f, INF)\n",a,a);continue;
}
else
{
printf("(-INF, INF)\n");continue;
}
}
}
}
return 0;
}
超级丑陋版:
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cmath>
using namespace std;
const double eps=1e-8;
int dlcmp(double x)
{
return x<-eps?-1:x>eps;
}
const double INF=1.0;
struct qj
{
double l,r;
int ll,rr;
}ans[20];
void P(int x)
{
if(ans[x].ll==0)
printf("(%.4f, ",ans[x].l);
else if(ans[x].ll==1)
printf("[%.4f, ",ans[x].l);
else if(ans[x].ll==2)
printf("(-INF, ");
if(ans[x].rr==0)
printf("%.4f)",ans[x].r);
else if(ans[x].rr==1)
printf("%.4f]",ans[x].r);
else if(ans[x].rr==3)
printf("INF)");
}
int cnt=0;
double a,b,c,d,e;
int t;
int main()
{
// freopen("in","r",stdin);
scanf("%d",&t);
while(t--)
{
cnt=0;
scanf("%lf %lf %lf %lf %lf",&a,&b,&c,&d,&e);
if(dlcmp(b-a*d)==0)
{
if(dlcmp(c-a*e)==0)
ans[cnt].l=a,ans[cnt].ll=1,ans[cnt].r=a,ans[cnt++].rr=1;
else if(dlcmp(e-d*d/4.0)>0)
{
if(dlcmp(c-a*e)>0) ans[cnt].l=a,ans[cnt].ll=0,ans[cnt].r=a+(c-a*e)/(e-d*d/4),ans[cnt++].rr=1;
else ans[cnt].r=a,ans[cnt].rr=0,ans[cnt].l=a+(c-a*e)/(e-d*d/4),ans[cnt++].ll=1;
}
else if(dlcmp(e-d*d/4.0)==0)
{
if(dlcmp(c-a*e)>0) ans[cnt].l=a,ans[cnt].ll=0,ans[cnt++].rr=3;
else ans[cnt].ll=2,ans[cnt].r=a,ans[cnt++].rr=0;
}
else
{
if(dlcmp(c-a*e)>0) ans[cnt].ll=2,ans[cnt].r=a+(c-a*e)/(e-d*d/4.0),ans[cnt++].rr=1,
ans[cnt].l=a,ans[cnt].ll=0,ans[cnt++].rr=3;
else ans[cnt].ll=2,ans[cnt].r=a,ans[cnt++].rr=0,
ans[cnt].l=a+(c-a*e)/(e-d*d/4.0),ans[cnt].ll=1,ans[cnt++].rr=3;
}
}
else
{
double temp=(c-a*e)*(c-a*e)/((b-a*d)*(b-a*d))-d*(c-a*e)/(b-a*d)+e;
double t1=2.0*sqrt((double)temp)+d-2.0*(c-a*e)/(b-a*d);
double t2=-2.0*sqrt((double)temp)+d-2.0*(c-a*e)/(b-a*d);
double tt1,tt2;
if(dlcmp(t1)!=0) tt1=a+(b-a*d)/t1; else tt1=1;
if(dlcmp(t2)!=0) tt2=a+(b-a*d)/t2; else tt2=1;
//cout<<temp<< " "<<t1<<" "<<t2<<" "<<tt1<<" "<<tt2<<endl;
double x1,x2,x3;
double ex1,ex2;
x1=(a*e-c)/(b-a*d);
if(dlcmp(x1*x1+d*x1+e)==0)
{
x2=-d-x1;ex2=a;ex1=a+(b-a*d)/(2.0*x1+d);if(ex1>ex2) swap(ex1,ex2);//printf("ex1=%lf ex2=%lf\n",ex1,ex2);
if(dlcmp(x1-x2)==0)
ans[0].ll=2,ans[0].r=a,ans[0].rr=0,ans[1].l=a,ans[1].ll=0,ans[1].rr=3,cnt=2;
else
ans[0].ll=2,ans[0].r=min(ex1,ex2),ans[0].rr=0,ans[1].l=min(ex1,ex2),ans[1].ll=0,ans[1].r=max(ex1,ex2),ans[1].rr=0,ans[2].l=max(ex1,ex2),ans[2].ll=0,ans[2].rr=3,cnt=3;
for(int i=0;i<cnt;i++)
{
P(i);
if(i!=cnt-1) printf(" U ");
else printf("\n");
}
continue;
}
if(dlcmp(temp)==0)
{
ans[cnt].r=a,ans[cnt].ll=2,ans[cnt++].rr=0;
ans[cnt].l=a,ans[cnt].ll=0,ans[cnt++].rr=3;
//ans[cnt].ll=2,ans[cnt++].rr=3;
}
else if(dlcmp(temp)>0)
{
if(dlcmp(t1)<0)
{
ans[cnt].ll=2,ans[cnt].r=min(tt1,tt2),ans[cnt++].rr=1;
ans[cnt].l=max(tt1,tt2),ans[cnt].rr=3,ans[cnt++].ll=1;
}
else if(dlcmp(t1)==0)
{
if(dlcmp(b-a*d)>0) ans[cnt].l=tt2,ans[cnt].rr=3,ans[cnt++].ll=1;
else ans[cnt].ll=2,ans[cnt].r=tt2,ans[cnt++].rr=1;
}
else if(dlcmp(t1)>0 && dlcmp(t2)<0)
{
ans[cnt].l=min(tt1,tt2),ans[cnt].r=max(tt1,tt2),ans[cnt].ll=1,ans[cnt++].rr=1;
}
else if(dlcmp(t1)>0 &&dlcmp(t2)==0)
{
if(dlcmp(b-a*d)>0) ans[cnt].ll=2,ans[cnt].r=tt1,ans[cnt++].rr=1;
else ans[cnt].l=tt1,ans[cnt].rr=3,ans[cnt++].ll=1;
}
else if(dlcmp(t1)>0 &&dlcmp(t2)>0)
{
ans[cnt].ll=2,ans[cnt].r=min(tt1,tt2),ans[cnt++].rr=1;
ans[cnt].l=max(tt1,tt2),ans[cnt].rr=3,ans[cnt++].ll=1;
}
}
else
{
ans[cnt].ll=2,ans[cnt++].rr=3;
}
}
for(int i=0;i<cnt;i++)
{
P(i);
if(i!=cnt-1) printf(" U ");
else printf("\n");
}
}
return 0;
}