随笔分类 - DP
摘要:Greatest Common Increasing SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5444Accepted...
阅读全文
摘要:首先,什么是子串,什么是子序列?子串必须连续,子序列可以不连续。 连续子序列就是子串最大和最长也不一样,最大是求子序列加起来的数值最大,最长是这个子序列的长度最长。最大连续子序列和或者 最大连续子序列其实可以叫做最大子串和求一个数列的最大的连续子序列的和是多少,通常还要得到是从哪开始到哪结束。例如...
阅读全文
摘要:Cow ExhibitionTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10342Accepted: 4048Description"Fat and docile, big and dumb, they look so stupi...
阅读全文
摘要:RobberiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16522Accepted Submission(s): 6065Problem ...
阅读全文
摘要:CRB and His BirthdayTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 430Accepted Submission(s): 237...
阅读全文
摘要:钱币兑换问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7658Accepted Submission(s): 4547Problem Desc...
阅读全文
摘要:Piggy-BankTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16255Accepted Submission(s): 8192Problem...
阅读全文
摘要:第一题是poj的3624 这题限制了空间,所以我也不知道我的二维的写的是不是一定是对的。Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it w...
阅读全文

浙公网安备 33010602011771号