poj2653（计算几何）

http://poj.org/problem?id=2653 

#include<iostream>
#include<cstdio>
#define eps 1e-8
const int maxn = 1e5+10;
using namespace std;
struct Point{
	double x;
	double y;
}pt1[maxn],pt2[maxn];
double mul(Point p1,Point p2,Point p3){
	return (p2.x-p1.x)*(p3.y-p1.y)-(p3.x-p1.x)*(p2.y-p1.y);
}
bool judge(Point p1,Point p2,Point p3,Point p4){
		if(mul(p1,p2,p3)*mul(p1,p2,p4)>eps||mul(p3,p4,p1)*mul(p3,p4,p2)>eps){
			return 0;
		}
	return 1;
}
int main(){
	int n;
	while(~scanf("%d",&n)){
		if(n==0) break;
		for(int i=1;i<=n;i++){
		//	getchar();
			scanf("%lf%lf%lf%lf",&pt1[i].x,&pt1[i].y,&pt2[i].x,&pt2[i].y);
		//	getchar()
		}
		printf("Top sticks:");
		for(int i=1;i<n;i++){
			int j;
			for( j=i+1;j<=n;j++){
				if(judge(pt1[i],pt2[i],pt1[j],pt2[j])){
					break;
				}
			}
			j--;
			//cout<<j<<endl;
			if(j==n){
				cout<<" "<<i<<",";
				}
		}
		cout<<" "<<n<<"."<<endl;
	}
	return 0;
}