链接:https://cn.vjudge.net/problem/POJ-2653
题意:按顺序放线段,后放的线段在上面,问在最上面的线段分别是什么?
思路:直接枚举判断后面的线段是否和它相交即可,由于题目保证最上面的线段最多有1000个,所以每个最多找1000次,由于不是严格的1000次,所以时间复杂度没问题。
#include <cstdio>
#include <iostream>
#include <cmath>
#define ll long long
using namespace std;
const double eps = 1e-8;
const int N = 1e5+10;
int sgn(double x)
{
if(fabs(x)<eps) return 0;
else if(x<0) return -1;
else return 1;
}
struct Point
{
double x,y;
Point(){}
Point(double x,double y):x(x),y(y){}
Point operator -(const Point& b)const//相减
{
return Point(x-b.x,y-b.y);
}
double operator ^(const Point& b)const//叉乘
{
return x*b.y-y*b.x;
}
double operator *(const Point& b)const//点乘
{
return x*b.x+y*b.y;
}
}s,e;
struct Line
{
Point s,e;
Line(){}
Line(Point ss,Point ee){ s=ss,e=ee;}
}ls[N];
bool vis[N];
int ans[N],cnt;
int n;
double x1,y1,x2,y2;
double dist(Point a,Point b)
{
return sqrt((a-b)*(a-b));
}
//判断线段相交
bool inter(Line l1,Line l2)
{
return max(l1.s.x,l1.e.x)>=min(l2.s.x,l2.e.x)
&& max(l2.s.x,l2.e.x)>=min(l1.s.x,l1.e.x)
&& max(l1.s.y,l1.e.y)>=min(l2.s.y,l2.e.y)
&& max(l2.s.y,l2.e.y)>=min(l1.s.y,l1.e.y)
&& sgn((l2.s-l1.s)^(l1.e-l1.s))*sgn((l2.e-l1.s)^(l1.e-l1.s))<=0
&& sgn((l1.s-l2.s)^(l2.e-l2.s))*sgn((l1.e-l2.s)^(l2.e-l2.s))<=0;
}
int main(void)
{
while(~scanf("%d",&n)&&n)
{
cnt=0;
for(int i=1;i<=n;i++) vis[i]=1;
for(int i=1;i<=n;i++)
{
scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);
ls[i]=Line(Point(x1,y1),Point(x2,y2));
}
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
if(inter(ls[i],ls[j]))
{
vis[i]=0;
break;
}
for(int i=1;i<=n;i++)
if(vis[i]) ans[++cnt]=i;
printf("Top sticks:");
for(int i=1;i<=cnt;i++)
printf(" %d%c",ans[i],i==cnt?'.':',');
putchar('\n');
}
return 0;
}