不要过于沉溺过去,也不要过于畅想未来,把握现在!

随笔分类 -  计算几何

摘要:思路: 运用队列存储没有被覆盖的木棍,没加入一个棍子,就要判断一下是否队列中的棍子被覆盖,如果被覆盖,就从队列中删除; 线段交判断方法:跨立实验Pick-up sticksTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 9698 ... 阅读全文
posted @ 2014-08-20 13:56 coding_yuan 阅读(172) 评论(0) 推荐(0)
摘要:题目意思:给定四个点,前两个点确定一条直线,后两个点确定一条直线,判断两条直线的位置关系;思路: 两条直线的位置关系分为三种情况: 1.重合:判断方法:((p1-q1)^(p2-q1))==0&&((p1-q2)^(p2-q2))==0 2.平行:判断方法:(p1-p2).x*(q1-q2).y... 阅读全文
posted @ 2014-08-19 23:39 coding_yuan 阅读(226) 评论(0) 推荐(0)
摘要:SegmentsTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 9564 Accepted: 2943 DescriptionGiven n segments in the two dimensional space, write... 阅读全文
posted @ 2014-08-19 16:53 coding_yuan 阅读(126) 评论(0) 推荐(0)
摘要:Toy StorageTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 3953 Accepted: 2334 DescriptionMom and dad have a problem: their child, Reza, ne... 阅读全文
posted @ 2014-08-19 00:49 coding_yuan 阅读(155) 评论(0) 推荐(0)
摘要:TOYSTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10425 Accepted: 5002DescriptionCalculate the number of toys that land in each bin of a p... 阅读全文
posted @ 2014-08-18 17:09 coding_yuan 阅读(179) 评论(0) 推荐(0)
摘要:1001 - Opposite TaskPDF (English) Statistics ForumTime Limit: 0.5 second(s) Memory Limit: 32 MBThis problem gives you a flavor the concept of special ... 阅读全文
posted @ 2014-08-07 20:52 coding_yuan 阅读(216) 评论(0) 推荐(0)
摘要:Intersection of CubesTime Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmitStatusPracticeLightOJ 1211DescriptionYou are given n cubes... 阅读全文
posted @ 2014-08-07 15:34 coding_yuan 阅读(673) 评论(0) 推荐(0)

不要过于沉溺过去,也不要过于畅想未来,把握现在!