关闭

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 shouldn’t be any small groups in a good team. In a team with n members,if there are three or more members are no...
阅读(14) 评论(0)

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

HDU - 6133 Army Formations(启发式合并+树状数组) 多校2017第八场 Problem Description > Stormtroopers were the assault/policing troops of the Galactic Empire. Dissenting citizens referred to them as bucketheads, a derogatory nickname inspired by the bucket-shaped helmets o...
阅读(36) 评论(0)

POJ - 1296 Intersecting Lines(计算几何)

点我看题 题意:给出两条直线,判断这两条直线的关系,即问是否相交,如果相交求出交点,如果不相交,那么他们是相离还是重合? 分析:首先去判断直线P1P2和Q1Q2和是否平行,判断直线平行可以利用叉乘。 如果(P2-P1)×(Q2-Q1)== 0的话,那么两直线平行; 得到直线平行,就要看是否重合了。 判断重合就相当于判断一条直线上的点是否存在于另一条直线上,假设这里我们看P1是否在Q1Q2...
阅读(21) 评论(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 that after projecting these segments on it, all projected segments have at least one point in common. Input...
阅读(13) 评论(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 them. They gave Reza a rectangular box to put his toys in. Unfortunately, Reza is rebellious and obeys his pa...
阅读(15) 评论(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 child John never puts his toys away when he is finished playing with them. They gave John a rectangular box ...
阅读(15) 评论(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 form a sequence with m integers. It's clear that we may get n ^ m this kind of sequences. Then we can calcu...
阅读(17) 评论(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 r. P and Q are two points not outside the circle, and PO = QO. You need to find a point D on the circle, wh...
阅读(55) 评论(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 column. Initially we have A[i, j] = 0 (1 <= i, j <= N). We can change the matrix in the following way. Given ...
阅读(17) 评论(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. One type of operation is to add a given number to a few numbers in a given interval. The other is to query...
阅读(17) 评论(0)

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

HDU - 1542 Atlantis(线段树扫描线求矩形并的面积) 线段树求矩形面积详解 Problem Description There are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts even include maps of parts of the island. But unfortunately, these maps des...
阅读(42) 评论(0)

ZOJ - 3574 Under Attack II(计算几何 归并排序)

ZOJ - 3574 Under Attack II(计算几何 归并排序) Because of the sucessfully calculation in Under Attack I, Doctor is awarded with Courage Cross and promoted to lieutenant. But the war seems to end in never, now Doctor has a new order to help anti-aircraft troops calc...
阅读(18) 评论(0)

HDU - 4911 Inversion(归并排序求逆序数)

HDU - 4911 Inversion(归并排序求逆序数) Problem Description bobo has a sequence a1,a2,…,an. He is allowed to swap two adjacent numbers for no more than k times. Find the minimum number of inversions after his swaps. Note: The number of inversions is the number o...
阅读(21) 评论(0)

POJ - 1804 Brainman(归并排序求逆序数)

POJ - 1804 Brainman(归并排序求逆序数) Description Background Raymond Babbitt drives his brother Charlie mad. Recently Raymond counted 246 toothpicks spilled all over the floor in an instant just by glancing at them. And he can even count Poker cards. Charlie wou...
阅读(17) 评论(0)

HDU - 1671 Phone List(字典树)

HDU - 1671 Phone List(字典树) Problem Description Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers: 1. Emergency 911 2. Alice 97 625 999 3. B...
阅读(22) 评论(0)
109条 共8页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:12122次
    • 积分:1144
    • 等级:
    • 排名:千里之外
    • 原创:107篇
    • 转载:2篇
    • 译文:0篇
    • 评论:1条