H The Biggest Triangle
题目大意:
给出n条直线(以两个点的形式给出),求这些直线交点形成的三角形的最大周长
解题思路:
n<=100 直接枚举3条直线,然后要注意两个直线没有交点的情况(平行),直接continue即可。
Code:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int maxn=1e6+100;
struct node{
double x1,y1,x2,y2;
}a[maxn];
struct line{
double a,b,c;
}b[maxn];
//直线一般式的ABC Ax+By+C=0
void jj(double x1,double y1,double x2,double y2,double&A,double&B,double&C){
A=y2-y1;
B=x1-x2;
C=x2*y1-x1*y2;
}
//判断两条直线是否相交
bool px(double x1,double y1,double x2,double y2){
return x1*y2==x2*y1;
}
//求两条直线的交点
int getjiao(double x1,double y1,double x2,double y2,double x3,double y3,double x4,double y4,double &x,double &y){//1-2 3-4
if(px(x2-x1,y2-y1,x4-x3,y4-y3)) return -1;
double a1,b1,c1,a2,b2,c2;
jj(x1,y1,x2,y2,a1,b1,c1);
jj(x3,y3,x4,y4,a2,b2,c2);
b1=-b1;b2=-b2;
double d=a1*b2-a2*b1;
x=(b1*c2-b2*c1)/d,y=(a1*c2-a2*c1)/d; //res
return 1;
}
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%lf%lf%lf%lf",&a[i].x1,&a[i].y1,&a[i].x2,&a[i].y2);
}
double ans=0;
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
double x1,y1;
if(getjiao(a[i].x1,a[i].y1,a[i].x2,a[i].y2,a[j].x1,a[j].y1,a[j].x2,a[j].y2,x1,y1)==-1) continue;
for(int k=j+1;k<=n;k++){
double x2,y2,x3,y3;
if(getjiao(a[i].x1,a[i].y1,a[i].x2,a[i].y2,a[k].x1,a[k].y1,a[k].x2,a[k].y2,x2,y2)==-1) continue;
if(getjiao(a[k].x1,a[k].y1,a[k].x2,a[k].y2,a[j].x1,a[j].y1,a[j].x2,a[j].y2,x3,y3)==-1) continue;
double u=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
double v=sqrt((x3-x2)*(x3-x2)+(y3-y2)*(y3-y2));
double w=sqrt((x1-x3)*(x1-x3)+(y1-y3)*(y1-y3));
ans=max(ans,u+v+w);
}
}
}
if(ans==0) printf("no triangle\n");
else printf("%.10lf\n",ans);
return 0;
}