随笔分类 -  hdu

http://acm.hdu.edu.cn/
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1114Piggy-BankTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5450Accepted Submission(s): 2714Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial suppor 阅读全文
posted @ 2012-08-14 15:41 free斩 阅读(177) 评论(0) 推荐(0)
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1058Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9933Accepted Submission(s): 4291Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequ 阅读全文
posted @ 2012-08-14 15:31 free斩 阅读(192) 评论(0) 推荐(0)
摘要:题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=2084数塔Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11282Accepted Submission(s): 6761Problem Description在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样描述的:有如下所示的数塔,要求从顶层走到底层,若每一步只能走到相邻的结点,则经过的结点的数字之和最大是多少?已经告诉你了,这是个D 阅读全文
posted @ 2012-08-14 14:55 free斩 阅读(122) 评论(0) 推荐(0)
摘要:题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1176免费馅饼Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14396Accepted Submission(s): 4763Problem Description都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果 阅读全文
posted @ 2012-08-14 14:50 free斩 阅读(165) 评论(0) 推荐(0)
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2602 Bone CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13839Accepted Submission(s): 5454Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was ca... 阅读全文
posted @ 2012-08-14 14:45 free斩 阅读(284) 评论(0) 推荐(0)
摘要:最经典、最基础的01背包入门题目题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2602Bone CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13839Accepted Submission(s): 5454Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called 阅读全文
posted @ 2012-08-14 14:45 free斩 阅读(121) 评论(0) 推荐(0)
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1506Largest Rectangle in a HistogramTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5475Accepted Submission(s): 1570Problem DescriptionA histogram is a polygon composed of a sequence of rectangles alig 阅读全文
posted @ 2012-08-14 14:36 free斩 阅读(225) 评论(0) 推荐(0)
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1231最大连续子序列Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11885Accepted Submission(s): 5005Problem Description给定K个整数的序列{ N1, N2, ..., NK },其任意连续子序列可表示为{ Ni, Ni+1, ...,Nj },其中 1 <= i <= j <= K 阅读全文
posted @ 2012-08-14 14:18 free斩 阅读(201) 评论(0) 推荐(0)
摘要:POJ 1573 && hdu 1035(简单模拟)感谢kb神题目链接:http://poj.org/problem?id=1573 http://acm.hdu.edu.cn/showproblem.php?pid=1035Robot MotionTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 7893Accepted: 3813DescriptionA robot has been programmed to follow the instructions in its path. Instructions 阅读全文
posted @ 2012-08-13 15:16 free斩 阅读(181) 评论(0) 推荐(0)
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2955RobberiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4778Accepted Submission(s): 1808Problem DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guy 阅读全文
posted @ 2012-07-26 20:00 free斩 阅读(342) 评论(0) 推荐(0)
摘要:水鸟第一篇解题报告,大牛们直接忽略即可题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1060LeftmostDigitProblemDescriptionGivenapositiveintegerN,youshouldoutputtheleftmostdigitofN^N.InputTheinputcontainsseveraltestcases.ThefirstlineoftheinputisasingleintegerTwhichisthenumberoftestcases.Ttestcasesfollow.Eachtestcaseconta 阅读全文
posted @ 2012-05-08 15:12 free斩 阅读(335) 评论(0) 推荐(1)
摘要:水鸟第一篇解题报告,大牛们直接忽略即可题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1060LeftmostDigitProblemDescriptionGivenapositiveintegerN,youshouldoutputtheleftmostdigitofN^N.InputTheinputcontainsseveraltestcases.ThefirstlineoftheinputisasingleintegerTwhichisthenumberoftestcases.Ttestcasesfollow.Eachtestcaseconta 阅读全文
posted @ 2012-04-20 23:12 free斩 阅读(175) 评论(0) 推荐(0)