题目在这里 Shenyang Online1001 Traversal1002 Best Solver1003 Minimum Cut1004 Dividing This Product1005 Excited Database1006 Fang Fang简单题1007 Matches Puzzle Game1008 Hold Your Hand1009 Stability1010 Jesus
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5014 Number Sequence Problem Description There is a special number sequence which has n+1 integers. For each number in sequence, we have two ru
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5024 题目的意思就是 :找只能拐一个90度的弯的最长路。。直接模拟就好。。 记得网赛的时候,对这个题的题意还是比较有争议的。。。 贴下最主要的题意:if there was a turn, that turn must be ninety degree. 如果有弯,那必须是90度的弯。。这一点
This way 题意: 给你n个点,让你在其中选k个点作为特殊点,使得所有点到其中距离自己最近的特殊点的距离最大值最小,求这个值 题解: n只有60,那么翻译一下这个就是重复覆盖问题。 那么我们只需要二分一下答案,将所有小于等于mid的值加到舞蹈链中,再跑一下即可。 注意其中的优化: 由与deep就是当前使用的点数,那么当deep>k的时候return,注意不能直接做这个判断: if(
This way 题意: 给你一棵树,两种操作: 1.将x到y的路径上的所有点的权值+k 2.将x到y路径上的所有边的权值+k 所有操作结束后问你所有的点权和所有的边权 题解: 这道题用树链剖分估计会T,因为它是 n l o g 2 n nlog^2n nlog2n的。 由于每次加的一定是一条链或者两条链,那么我们只需要用前缀和的思想去做即可,也就是说加点权的时候在x的位置加上k,y的位置
请原谅我是个弱逼。 Pro.IDTitle4278Faulty Odometer4279Number4280Island Transport4281Judges' response4282A very hard mathematic problem4283You Are the One4284Travel4285circuits4286Data Handler4287Intelligent
A. Girls Band Party 题目链接 Description You are currently playing a game called “Garupa”. In an event of the game, you are trying to get more event points. You have nn cards, each with its own name, c
Problem A. I Count Two Three(点击转到) Time limit: 1s Color of balloons: 32768K I will show you the most popular board game in the Shanghai Ingress Resistance Team. It all started several months ago. We f
number number number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 235 Accepted Submission(s): 151 Problem Description We def
http://acm.hdu.edu.cn/showproblem.php?pid=4001 Problem Description Do you remember our children time? When we are children, we are interesting in almost everything around ourselves. A little thing or
http://acm.hdu.edu.cn/showproblem.php?pid=4002Problem DescriptionEuler's Totient function, φ (n) [sometimes called the phi function], is used to determine the number of numbers less than n which