POJ2074：直线相交

POJ2074

题解

看着上面的图讲话。

• 就是求两条直线与最下面直线的交点。
• 注意如果障碍物不在h的下方或者不在r的上方，就不要计算了。
• 先对障碍物左端点排序，然后从左到右扫描。用一个标记last记录盲区的右端点，就是求（左端点 - last）的最大值。有一种情况可能是右端点坐标变小了，因为这一次的障碍物比上一次的还短。所以我们要保留右端点的最大值。

代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
using namespace std;
double const eps = 1e-8;
int const N = 1000 + 10;
int n;
double x1,x2,y,ans,last;
typedef struct Point{   //点和向量
	double x,y;
	Point(){};
	Point(double x,double y):x(x),y(y){};
	Point operator - (const Point& e)const{   //减
		return Point(x - e.x,y - e.y);
	}
	Point operator + (const Point& e)const{   //减
		return Point(x + e.x,y + e.y);
	}
	double operator ^ (const Point& e)const{  //叉乘
		return x * e.y - y * e.x;
	}
	double operator * (const Point& e)const{  //点积
		return x * e.x + y * e.y;
	}
}Vector;
struct Line{    //直线的定义
	Point a,b;
	Line(){};
	Line(Point a,Point b):a(a),b(b){}
}house,line,obstru[N];
int dcmp(double x){    //判断符号
	if(fabs(x) < eps)	return 0;
	else return x < 0 ? -1 : 1;
}
Point intersection(Point p,Vector v,Point q,Vector w){   //两直线(p+tv)和(q+tw)求交点
	Vector u = p - q;
	double t = (w ^ u) / (v ^ w);
	return p + Point(v.x * t,v.y * t);
}
void Init(){
	house = Line(Point(x1,y),Point(x2,y));
	scanf("%lf%lf%lf",&x1,&x2,&y);
	line = Line(Point(x1,y),Point(x2,y));
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%lf%lf%lf",&x1,&x2,&y);
		obstru[i] = Line(Point(x1,y),Point(x2,y));
	}
}
bool cmp(Line l1,Line l2){
	return l1.a.x < l2.a.x || l1.a.x == l2.a.x && l1.b.x < l2.b.x;
}
int main(){
	while(~scanf("%lf%lf%lf",&x1,&x2,&y)){
		if(x1 == 0 && x2 == 0 && y == 0)	break;
		Init();
		sort(obstru+1,obstru+1+n,cmp);
		ans = 0;
		last = line.a.x;
		for(int i=1;i<=n;i++){
			if(dcmp(obstru[i].a.y - house.a.y) >= 0)	continue;
			if(dcmp(obstru[i].a.y - line.a.y) <= 0)	continue;
			Point p1 = intersection(line.a,line.b - line.a,obstru[i].a,obstru[i].a - house.b);
			Point p2 = intersection(line.a,line.b - line.a,obstru[i].b,obstru[i].b - house.a);
			ans = max(ans,p1.x - last);
			last = max(last,p2.x);
		}
		ans = max(ans,line.b.x - last);
		if(dcmp(ans) == 0)	printf("No View\n");
		else	printf("%.2f\n",ans);
	}
	return 0;
}