随笔分类 - DP
摘要:Piggy-Bank Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 10830 Accepted: 5275 Description Before ACM can do anything, a budget must be pr
阅读全文
摘要:Cash Machine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 33444 Accepted: 12106 Description A Bank plans to install a machine for cash w
阅读全文
摘要:Charm Bracelet Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 34532 Accepted: 15301 Description Bessie has gone to the mall's jewelry stor
阅读全文
摘要:Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15817Accepted Submission(s): 5140...
阅读全文
摘要:MatrixTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1394Accepted Submission(s): 758Problem Descr...
阅读全文
摘要:WormTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2637Accepted Submission(s): 1707Problem Descri...
阅读全文
摘要:汉诺塔IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4529Accepted Submission(s): 2231Problem Descr...
阅读全文
摘要:Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15978Accepted Submission(s): 6915Pro...
阅读全文
摘要:Monkey and BananaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6846Accepted Submission(s): 3508P...
阅读全文
摘要:Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20485Accepted Subm...
阅读全文
摘要:免费馅饼Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23717Accepted Submission(s): 7989Problem Descr...
阅读全文
摘要:数塔Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20191Accepted Submission(s): 12103Problem Descri...
阅读全文
摘要:Max SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 134690Accepted Submission(s): 31181Problem ...
阅读全文
摘要:转自:http://www.hnyzsz.net/Article/ShowArticle.asp?ArticleID=735【石子合并】 在一个圆形操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2 堆石子合并成新的一堆,并将新的一堆石子数记为该次合并的得分。 试设计一个算法,计算出将n堆石子合并成一堆的最小得分和最大得分。【输入文件】包含两行,第1 行是正整数n(1n then t←(i+k) mod n else t←i+k {最后一个连第一个的情况处理} s[i,j]←最优{s[i,k]+s[t,j-k]+sum[1,3]} {sum[i,j]表示从i开始数
阅读全文