摘要:
/*多重背包模板【若要求恰好装满,初始化时f[1...V] = -INF(求最大)或INF(求最小),f[0] = 0】【若费用==价值时,如硬币能组成多少钱,用背包做时,f[i(费用)] 必定 == i(最大价值) (设能组成i元) ,因为能组成i元。费用为i时,最大价值若少于i的x的话与能... 阅读全文
摘要:
Little Tiger vs. Deep MonkeyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1587Accepted Submissio... 阅读全文