若忆_star

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1556Color the ballTime Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11361    Accepted Submissio

题目链接：acm.hdu.edu.cn/showproblem.php?pid=5685Problem ATime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 564    Accepted Submission(s): 23

Count ColorChosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem. There is a very long board with length L centimeter, L is a positive integer, so we can evenly divid

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3308LCISTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5792 Accepted Submission(s): 2513Problem DescriptionGiven n integers.You have two ope

题目链接:http://poj.org/problem?id=3468A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 83959 Accepted: 25989Case Time Limit: 2000MSDescriptionYou have N integers, A1, A2, ... , AN. You need to deal with two kin

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1698Just a HookProblem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of t

Tunnel WarfareTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6065 Accepted Submission(s): 2344Problem DescriptionDuring the War of Resistance Against Japan, tunnel warfare was carried out e

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2795Billboard题目大意：一个h*w的公告牌，要在其上贴公告。输入的是1*wi的w值，这些是公告的尺寸接下来要满足的条件有：1、尽量往上，同一高度尽量靠左。2、求第n个广告所在的行数。3、没有合适的位置贴了则输出-1。解题思路：利用线段树可以得出区间的最大值，在结构体中定义一个Max变量，用来表示这段区间内有最多空位的那一行的空位长度。与输入进来的长度进行比较，先左边比较，再右边。（也就是左子

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2795Billboard题目大意：有一块尺寸为h*w的矩形长板，要在上面贴1*wi的海报n张。海报贴的位置要尽量靠左，如果一行能够填满就填满，最后输出的是这张海报贴的高度位置。 解题思路:用高度进行建树，每一次比较宽度，在结构体里面定义一个mmax来表示最大的宽度，这个宽度在Updata（）这个函数中不断地更新。一直不断的将以下的最大值反馈到父亲结点。 特别注意：1、如果高度是5，但是有2个海报，这样

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1754I Hate ItTime Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 45334    Accepted Submission(s):

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1166敌兵布阵题目大意：中文题意很清晰，这是第一道线段树题目，代码估计有很多地方可以改进。这道题目如果用几个for循环来直接查找，200000想想都会超时.

题目链接：http://acm.split.hdu.edu.cn/showproblem.php?pid=5861RoadTime Limit: 12000/6000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 661    Accepted Subm