Vmorish

—— Anything is possible

HDU - 4128 Running relay(贪心+凸包+三分)

HDU - 4128 Running relay(贪心+凸包+三分) Problem Description The school track-and-field team is taking a running relay race. There are n (2<=n<=104)...

2017-08-31 19:30:55

阅读数:212

评论数:0

ZOJ - 3806 Incircle and Circumcircle(计算几何+二分)

ZOJ - 3806 Incircle and Circumcircle(计算几何+二分) A triangle is one the basic shapes in geometry. It's a polygon with three vertices and three sides whi...

2017-08-30 08:59:24

阅读数:141

评论数:0

HYSBZ - 1036 树的统计Count(树链剖分)

HYSBZ - 1036 树的统计Count(树链剖分) Description   一棵树上有n个节点,编号分别为1到n,每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成 一些操作: I. CHANGE u t : 把结点u的权值改为t II. QMAX u v: 询问从点u到点...

2017-08-29 09:19:50

阅读数:158

评论数:0

POJ - 3237 Tree(树链剖分)

POJ - 3237 Tree(树链剖分) Description You are given a tree with N nodes. The tree’s nodes are numbered 1 through N and its edges are numbered 1 through ...

2017-08-28 19:27:11

阅读数:150

评论数:0

FZU - 2082 过路费(树链剖分)

FZU - 2082 过路费(树链剖分) Problem Description 有n座城市,由n-1条路相连通,使得任意两座城市之间可达。每条路有过路费,要交过路费才能通过。每条路的过路费经常会更新,现问你,当前情况下,从城市a到城市b最少要花多少过路费。 Input 有多组样例,每组样...

2017-08-28 10:19:55

阅读数:98

评论数:0

POJ - 2763 Housewife Wind(树链剖分)

POJ - 2763 Housewife Wind(树链剖分) Description After their royal wedding, Jiajia and Wind hid away in XX Village, to enjoy their ordinary happy life. P...

2017-08-24 10:09:37

阅读数:104

评论数:0

HDU - 3966 Aragorn's Story(树链剖分)

HDU - 3966 Aragorn's Story(树链剖分) Problem Description Our protagonist is the handsome human prince Aragorn comes from The Lord of the Rings. One day A...

2017-08-23 15:35:16

阅读数:94

评论数:0

HDU - 6162 Ch’s gift(树链剖分)

HDU - 6162 Ch’s gift(树链剖分) Problem Description Mr. Cui is working off-campus and he misses his girl friend very much. After a whole night tossing and...

2017-08-23 10:03:35

阅读数:204

评论数:0

SPOJ - QTREE Query on a tree(树链剖分)

SPOJ - QTREE Query on a tree You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. We will as...

2017-08-20 20:37:54

阅读数:130

评论数:0

HDU - 6152 Friend-Graph(= =)

HDU - 6152 Friend-Graph Problem Description It is well known that small groups are not conducive of the development of a team. Therefore, there shoul...

2017-08-19 19:47:44

阅读数:154

评论数:0

HDU - 6133 Army Formations(启发式合并+树状数组)

HDU - 6133 Army Formations(启发式合并+树状数组) 多校2017第八场 Problem Description > Stormtroopers were the assault/policing troops of the Galactic Empire. Diss...

2017-08-18 16:38:36

阅读数:333

评论数:0

POJ - 1296 Intersecting Lines(计算几何)

点我看题 题意:给出两条直线,判断这两条直线的关系,即问是否相交,如果相交求出交点,如果不相交,那么他们是相离还是重合? 分析:首先去判断直线P1P2和Q1Q2和是否平行,判断直线平行可以利用叉乘。 如果(P2-P1)×(Q2-Q1)== 0的话,那么两直线平行; 得到直线平行,就要看是否重合了。...

2017-08-16 17:04:44

阅读数:118

评论数:0

POJ - 3304 Segments(计算几何)

POJ - 3304 Segments(计算几何) Description Given n segments in the two dimensional space, write a program, which determines if there exists a line such t...

2017-08-16 15:33:53

阅读数:141

评论数:0

POJ - 2398 Toy Storage(计算几何)

POJ - 2398 Toy Storage(计算几何) Description Mom and dad have a problem: their child, Reza, never puts his toys away when he is finished playing with th...

2017-08-15 18:52:34

阅读数:116

评论数:0

POJ - 2318 TOYS(计算几何)

POJ - 2318 TOYS(计算几何) Description Calculate the number of toys that land in each bin of a partitioned toy box. Mom and dad have a problem - their c...

2017-08-15 08:50:00

阅读数:118

评论数:0

POJ - 2442 Sequence(优先队列/堆)

POJ - 2442 Sequence(优先队列/堆) Description Given m sequences, each contains n non-negative integer. Now we may select one number from each sequence to ...

2017-08-13 21:01:29

阅读数:170

评论数:0

(2017多校6)1002/hdu-6097 Mindis(计算几何)

(2017多校6)1002/hdu-6097 Mindis(计算几何) Problem Description The center coordinate of the circle C is O, the coordinate of O is (0,0) , and the radius is ...

2017-08-11 16:05:56

阅读数:258

评论数:0

POJ - 2155 Matrix(二维线段树)

POJ - 2155 Matrix(二维线段树) Description Given an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th colu...

2017-08-09 19:38:14

阅读数:130

评论数:0

HDU - 4267 A Simple Problem with Integers(线段树)

HDU - 4267 A Simple Problem with Integers(线段树) Problem Description Let A1, A2, ... , AN be N elements. You need to deal with two kinds of operations....

2017-08-09 15:47:07

阅读数:134

评论数:0

HDU - 1542 Atlantis(线段树扫描线求矩形并的面积)

HDU - 1542 Atlantis(线段树扫描线求矩形并的面积) 线段树求矩形面积详解 Problem Description There are several ancient Greek texts that contain descriptions of the fabled islan...

2017-08-09 11:46:00

阅读数:382

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭