hdu Pick-up sticks 线段相交问题
来源:互联网 发布:tp路由器访客网络 编辑:程序博客网 时间:2024/06/05 19:45
Problem Description
Stan has n sticks of various length. He throws them one at a time on the floor in a random way. After finishing throwing, Stan tries to find the top sticks, that is these sticks such that there is no stick on top of them. Stan has noticed that the last thrown stick is always on top but he wants to know all the sticks that are on top. Stan sticks are very, very thin such that their thickness can be neglected.
Input
Input consists of a number of cases. The data for each case start with 1 ≤ n ≤ 100000, the number of sticks for this case. The following n lines contain four numbers each, these numbers are the planar coordinates of the endpoints of one stick. The sticks are listed in the order in which Stan has thrown them. You may assume that there are no more than 1000 top sticks. The input is ended by the case with n=0. This case should not be processed.
Output
For each input case, print one line of output listing the top sticks in the format given in the sample. The top sticks should be listed in order in which they were thrown.
The picture to the right below illustrates the first case from input.
The picture to the right below illustrates the first case from input.
Sample Input
51 1 4 22 3 3 11 -2.0 8 41 4 8 23 3 6 -2.030 0 1 11 0 2 12 0 3 10
Sample Output
Top sticks: 2, 4, 5.Top sticks: 1, 2, 3.
#include<iostream>#include<string.h>#include<stdio.h>using namespace std;struct node{double x,y;};struct p{node a,b;}p[110000];int a[11000];bool jude(node a,node b,node c,node d){ if(!(min(a.x,b.x)<=max(c.x,d.x) && min(c.y,d.y)<=max(a.y,b.y)&& min(c.x,d.x)<=max(a.x,b.x) && min(a.y,b.y)<=max(c.y,d.y))) return false; double u,v,w,z;//分别记录两个向量 u=(c.x-a.x)*(b.y-a.y)-(b.x-a.x)*(c.y-a.y);//叉乘为x1y2-x2y1; v=(d.x-a.x)*(b.y-a.y)-(b.x-a.x)*(d.y-a.y); w=(a.x-c.x)*(d.y-c.y)-(d.x-c.x)*(a.y-c.y); z=(b.x-c.x)*(d.y-c.y)-(d.x-c.x)*(b.y-c.y); return (u*v<=0.00000001 && w*z<=0.00000001);}int main(){ int n,j,i,ans; while(scanf("%d",&n)) { if(n==0) break; memset(a,0,sizeof(a)); for(i=0;i<n;i++) scanf("%lf%lf%lf%lf",&p[i].a.x,&p[i].a.y,&p[i].b.x,&p[i].b.y); for(i=0;i<n-1;i++) for(j=i+1;j<n;j++) if(jude(p[i].a,p[i].b,p[j].a,p[j].b)) { a[i]=1;//有交点 break; } printf("Top sticks: "); for(i=0;i<n-1;i++) if(a[i]!=1) printf("%d, ",i+1); printf("%d.\n",n); //cout<<n<<"."<<endl; } return 0;}
0 0
- hdu Pick-up sticks 线段相交问题
- hdu 1147 pick up sticks 几何问题线段相交
- poj2653-Pick-up sticks(线段相交问题)
- hdu 1147 Pick-up sticks 向量积求线段相交
- HDU 1147 Pick-up sticks(简单的线段相交)
- HDU 1147 Pick-up sticks(线段是否相交)
- hdu 1147 Pick-up sticks(线段相交+枚举)
- hdu acm 1147 Pick-up sticks(判断线段相交)
- hdu-1147 Pick-up sticks(判断线段相交)
- HDU 1147 Pick-up sticks(线段相交)
- POJ 2653 Pick-up sticks 线段相交问题
- POJ 2653 Pick-up sticks 线段相交问题
- POJ2653(Pick-up sticks)(线段相交问题)
- POJ2653 Pick-up sticks 判断线段相交
- POJ 2635 Pick-up sticks (线段相交)
- 【poj 2653】 Pick-up sticks 线段相交
- poj 2653 Pick-up sticks 线段相交
- POJ-2653 Pick-up sticks(线段相交)
- KVC中setValuesForKeysWithDictionary:
- timer的用法
- 打开自己的应用 在Appstore中
- Word Ladder II
- Opencv 完美配置攻略 2014 (Win8.1 + Opencv 2.4.8 + VS 2013)
- hdu Pick-up sticks 线段相交问题
- 打印家目录下的jpg格式图片
- 第七周项目三(1)求出两数正差值
- hadoop错误
- 关于float型的内存存储和精度丢失问题
- hdu 3697 贪心
- 飘逸的python - 几行代码实现unix管道风格的函数调用
- code[vs] 1075 明明的随机数
- 你所知道的并不是你真的知道 —— 程序语言的精髓