- 博客(6)
- 收藏
- 关注
RSS订阅原创 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,yi,zi) and (xj,yj,zj) xi≥xj yi≥yj zi≥zj, the bigger one level add 1 Ask for the each level of the point.
2017-10-17 19:54:16
234
原创 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 ball stands still at point A, then we'll give it an initial speed and a direction. If the ball hits the cylind
2017-10-15 12:43:13
355
转载 ACM计算几何题目推荐
原文地址:http://blog.csdn.net/zsc09_leaf/article/details/6331809 快出去比赛了,这三四天尽量多刷一点计算几何的题了,emmmm紧张诶 //第一期 计算几何题的特点与做题要领： 1.大部分不会很难，少部分题目思路很巧妙 2.做计算几何题目，模板很重要，模板必须高度可靠。 3.要注意代码的组织，因为计算几何
2017-10-13 23:03:14
280
原创 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 adventure, they are forced to save money on buying fence posts by using trees as fence posts wherever possible. Gi
2017-10-13 17:31:45
293
原创 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, each object has 2 indexes a and b (a, b ≤ 500). The resemblance of object i and object j is defined by dij = |
2017-10-11 10:50:13
392
原创 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 long names are somewhat inconvenient, so the Berlanders started to abbreviate the names of their kings. Th
2017-10-09 09:59:32
377
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人