—— Anything is possible

HDU - 5618 Jam's problem again(cdq分治和整体二分)

Problem Description Jam like to solve the problem which on the 3D-axis,given N(1≤N≤100000) points (x,y,z)(1≤x,y,z≤100000) If two point such as (xi,y...

2017-10-17 19:54:16

阅读数 95

评论数 0

HDU - 5572 An Easy Physics Problem(计算几何)

Problem Description On an infinite smooth table, there's a big round fixed cylinder and a little ball whose volume can be ignored. Currently the bal...

2017-10-15 12:43:13

阅读数 144

评论数 0


原文地址:http://blog.csdn.net/zsc09_leaf/article/details/6331809 快出去比赛了,这三四天尽量多刷一点计算几何的题了,emmmm紧张诶 //第一期 计算几何题的特点与做题要领: 1.大部分不会很难,少部分题目...

2017-10-13 23:03:14

阅读数 143

评论数 0

POJ - 3348 Cows(求凸包的面积)

Description Your friend to the south is interested in building fences and turning plowshares into swords. In order to help with his overseas adventu...

2017-10-13 17:31:45

阅读数 98

评论数 0

POJ - 3241 Object Clustering(莫队算法/曼哈顿最小生成树)

Description We have N (N ≤ 10000) objects, and wish to classify them into several groups by judgement of their resemblance. To simply the model, eac...

2017-10-11 10:50:13

阅读数 135

评论数 0

CodeForces - 191A Dynasty Puzzles(dp)

The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But...

2017-10-09 09:59:32

阅读数 189

评论数 0

取消 删除