2011年8月4日

ACM HDU 1160FatMouse's Speed

摘要： FatMouse's SpeedTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3610Accepted Submission(s): 1522Special JudgeProblem DescriptionFatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a c 阅读全文

posted @ 2011-08-04 21:34 kuangbin 阅读(2966) 评论(6) 推荐(0) 编辑

ACM HDU 1114 Piggy-Bank (完全背包问题）

摘要： Piggy-BankTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2795Accepted Submission(s): 1379Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes f 阅读全文

posted @ 2011-08-04 20:04 kuangbin 阅读(4852) 评论(0) 推荐(2) 编辑

ACM HDU 1074 Doing Homework(位运算，搜索，状态压缩DP）

摘要： Doing HomeworkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1950Accepted Submission(s): 685Problem DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of han 阅读全文

posted @ 2011-08-04 16:56 kuangbin 阅读(3517) 评论(1) 推荐(2) 编辑

HDU 1087 Super Jumping! Jumping! Jumping! （求最大上升子序列和，动态规划）

摘要： Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9053Accepted Submission(s): 3693Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good 阅读全文

posted @ 2011-08-04 15:19 kuangbin 阅读(505) 评论(0) 推荐(0) 编辑

ACM HDU 1069 Monkey and Banana (动态规划）

摘要： Monkey and BananaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2599Accepted Submission(s): 1345Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, an 阅读全文

posted @ 2011-08-04 14:09 kuangbin 阅读(5311) 评论(0) 推荐(2) 编辑

HDU 1231 最大连续子序列（和HDU1003 Max Sum类似的）

摘要： 最大连续子序列Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7999Accepted Submission(s): 3335Problem Description给定K个整数的序列{ N1, N2, ..., NK }，其任意连续子序列可表示为{ Ni, Ni+1, ..., Nj }，其中 1 <= i <= j <= K。最大连续子序列是所有连续子序列中元素和最大的一个， 例如给定序列{ -2, 11, -4, 13, 阅读全文

posted @ 2011-08-04 12:42 kuangbin 阅读(556) 评论(0) 推荐(0) 编辑

HDU 1024 Max Sum Plus Plus（动态规划，给定一个数组，求其分成m个不相交子段和最大值的问题）

摘要： Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6725Accepted Submission(s): 2251Problem DescriptionNow I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves t 阅读全文

posted @ 2011-08-04 11:10 kuangbin 阅读(14935) 评论(1) 推荐(7) 编辑

HDU 1003 Max Sum(连续子列的最大和，动态规划）

摘要： Max SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 55792Accepted Submission(s): 12580Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max 阅读全文

posted @ 2011-08-04 10:12 kuangbin 阅读(511) 评论(0) 推荐(0) 编辑

ACM POJ 1015 Jury Compromise（陪审团的人选，动态规划题，难）

摘要： Jury CompromiseTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 18378Accepted: 4516Special JudgeDescriptionIn Frobnia, a far-away country, the verdicts in court trials are determined by a jury consisting of members of the general public. Every time a trial is set to begin, a jury has to be s 阅读全文

posted @ 2011-08-04 01:16 kuangbin 阅读(6580) 评论(3) 推荐(2) 编辑

导航

JAVASCRIPT: