摘要：
是一道多重背包的题目，因为数据量比较大，所以需要把0-1背包的情况用二进制处理，变成log(n)的复杂度。题目：CoinsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2339Accepted Submission(s): 956Problem DescriptionWhuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day... 阅读全文
浙公网安备 33010602011771号