nka_kun的博客

PUBG is a multiplayer online battle royale video game. In the game, up to one hundred players parachute onto an island and scavenge for weapons and equipment to kill others while avoiding getting killed themselves. BaoBao is a big fan of the game, but this

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4311题意：选中一个点，使其他点到这个点的曼哈顿距离之和最小.思路：加入我们选中一个点(x,y)，那么其他点到这个点的曼哈顿距离之和为|x-x1|+|x-x2|+···+|x-xn| + |y-y1|+|y-y2|+···+|y-yn|我们发现其实就是x被用了很多次，然后对其他x求和,y同理....

**题目：http://poj.org/problem?id=2926题意：求五维空间最远曼哈顿距离.思路：曼哈顿距离:dis = |x1-x2|+|y1-y2|切比雪夫距离:dis = max(|x1-x2|,|y1-y2|)求曼哈顿距离若去掉绝对值，即在以下4项中选择最大值.(x1-x2)+(y1-y2)(-x1+x2)+(y1-y2)(x1-x2)+(-y1+y2)(-x1+...

题目链接:http://codeforces.com/gym/100792/problem/G题意：给出n个坐标整数点，求出距离最远的两个点.两点之间的路径为只能走整数点.思路：显然两点之间的路径为sqrt(2)*min(|x1-x2|,|y1-y2|)+max(|x1-x2|,|y1-y2|)-min(|x1-x2|,|y1-y2|) =(sqrt(2)-1)*min(|x1-x2|...

                                                                                Interstellar Travel                                                                Time Limit: 4000/2000 MS (Java/Other...

Pick-up sticksTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 14261 Accepted: 5398DescriptionStan has n sticks of various length. He throws them one at a time on the floor in a random way. A...

首先声明几点定义：矢量      如果一条线段的端点是有次序之分的话，那么这种线段就称为 有向线段，如果有向线段p1p2的起点p1在坐标的原点，则可以把它称为矢量 p2矢量的加减      设二维矢量 P = (x1, y1), Q = (x2, y2)，则 P + Q = (x1 + x2, y1 + y2), P - Q = (x1 - x2, y1 - y2)，且有 P + Q = Q + ...

SegmentsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16366 Accepted: 5160DescriptionGiven n segments in the two dimensional space, write a program, which determines if there exists a line...

t,样例个数n,直线条数p,交点代码：//此程序可以判断是否所有直线交于一点 #include<cstdio>#include<iostream>#include<algorithm>#include<queue>#include<stack>#include<cstring>#include<string...

TOYSTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 17182 Accepted: 8195DescriptionCalculate the number of toys that land in each bin of a partitioned toy box. Mom and dad have a problem - t...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4312题意:选中一个点，使其他点到这个点的切比雪夫距离之和最小.思路:将一个点(x,y)的坐标变为(x+y,x−y)后,原坐标系中的曼哈顿距离 = 新坐标系中的切比雪夫距离将一个点(x,y)的坐标变为((x+y)/2,(x−y)/2) 后,原坐标系中的切比雪夫距离 = 新坐标系中的曼哈顿距离参...