题目大意：一次丢下去n根木棒，问那些木棒不被其他木棒压着，依次输出。

题目思路：叉积判断线段是否相交，吐槽下POJ数据真弱竟然没超时……

#include
      
       #include
       
        #include
        
         #include
         
          #include
          
           #include
           
            #include
            
             #include
             
              #define INF 0x3f3f3f3f#define MAX 100005struct node{ double x1,y1,x2,y2;}point[MAX];int vis[MAX],n;double Cross(double x1,double y1,double x2,double y2,double x3,double y3,double x4,double y4){ double a=(x2-x1)*(y3-y1)-(x3-x1)*(y2-y1); double b=(x2-x1)*(y4-y1)-(x4-x1)*(y2-y1); return a*b;}void Solve(){ for(int i=1;i