题目链接 http://acm.hdu.edu.cn/showproblem.php?pid=1712 思路 分组背包模板题(刚开始忘了清空dp数组,一直WA,QAQ),压缩成一维后 f [ j ] f [ j ] f[j]表示在只能选 i 门的情况下,不超过 j 天的收益。然后状态转移方程是分组背包模板, f [ j ] = m a x ( f [ j ] , f [ j − k ] + a [
题目: ACboy needs your help again! Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6094 Accepted Submission(s): 3197 Problem Descri