摘要：
http://poj.org/problem?id=2576二维数组01背包的变形。Tug of WarTime Limit:3000MSMemory Limit:65536KTotal Submissions:8147Accepted:2191DescriptionA tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team or the o 阅读全文
摘要：
http://acm.hdu.edu.cn/showproblem.php?pid=1114完全背包，求最小，要把dp的初始值改为很大的数值。 Piggy-BankTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9812Accepted Submission(s): 4932 Problem DescriptionBefore ACM can do anything, a budget must be prepared and the nec 阅读全文