动态规划
文章平均质量分 89
LLawliet
代码人生
展开
-
JOJ2529:Chorus
题目传送门:http://acm.jlu.edu.cn/joj/showproblem.php?pid=2529中文叙述,就不在多说了。思路:从1到n求一次到每个位置最长上升子序列,之后再从n到1求一次。找到每个位置两个序列和最大max,ans = n - max + 1(因为i位置算了两次)。代码:#include #include #include using nam原创 2011-11-17 13:57:39 · 264 阅读 · 0 评论 -
HDU3022:Sum of Digits
Sum of DigitsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 149 Accepted Submission(s): 46Problem DescriptionPetka thought o原创 2011-10-31 22:24:41 · 714 阅读 · 0 评论 -
HDU3022:Sum of Digits
Sum of DigitsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 149 Accepted Submission(s): 46Problem DescriptionPetka thought o原创 2011-10-31 22:26:20 · 407 阅读 · 0 评论 -
HDU2929:Bigger is Better
Bigger is BetterTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 559 Accepted Submission(s): 155Problem DescriptionBob has n原创 2011-10-31 22:25:20 · 625 阅读 · 0 评论 -
HUST1380:NumberPyramids
NumberPyramidsTime Limit: 20 Sec Memory Limit: 128 MBSubmissions: 103 Solved: 41Description Suppose that there are N numbers written in a row. A row above this one consists of N-1 nu原创 2011-10-31 22:26:44 · 311 阅读 · 0 评论 -
zjut1418:Max Xor Sub-sequence II
Max Xor Sub-sequence II Time Limit:1000MS Memory Limit:32768KDescription:Give you a sequence of integer numbers which are 1 or 0. You are to find the number of consecutive sub-sequence, w原创 2011-10-31 22:27:17 · 466 阅读 · 0 评论 -
2011 ACM/ICPC 北京赛区现场赛解题:Activation
ActivationTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 238 Accepted Submission(s): 57Problem DescriptionAfter 4 years' w原创 2011-11-09 01:36:02 · 1755 阅读 · 4 评论