https://blog.youkuaiyun.com/ResCellszh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/ResCells/article/details/143201367https://blog.youkuaiyun.com/ResCells/article/details/143201367ResCellsThu, 24 Oct 2024 10:58:05 +0800https://blog.youkuaiyun.com/ResCells/article/details/143069381https://blog.youkuaiyun.com/ResCells/article/details/143069381ResCellsSat, 19 Oct 2024 11:27:01 +0800dp[i, j]:表示只考虑前i个物品,物品总体积。就因为这个不超过,很容易联想到背包问题的思考方式;个物品放入背包中,那么在这道题,其实也可以用类似的方式考虑,即是否把第。]]>https://blog.youkuaiyun.com/ResCells/article/details/143064798https://blog.youkuaiyun.com/ResCells/article/details/143064798ResCellsSat, 19 Oct 2024 00:48:54 +0800https://blog.youkuaiyun.com/ResCells/article/details/142834793https://blog.youkuaiyun.com/ResCells/article/details/142834793ResCellsFri, 11 Oct 2024 00:09:33 +0800最长上升子序列,就是两个循环嵌套就解决了;]]>https://blog.youkuaiyun.com/ResCells/article/details/142780999https://blog.youkuaiyun.com/ResCells/article/details/142780999ResCellsWed, 09 Oct 2024 11:08:41 +0800https://blog.youkuaiyun.com/ResCells/article/details/142753675https://blog.youkuaiyun.com/ResCells/article/details/142753675ResCellsTue, 08 Oct 2024 11:07:21 +0800https://blog.youkuaiyun.com/ResCells/article/details/142748191https://blog.youkuaiyun.com/ResCells/article/details/142748191ResCellsMon, 07 Oct 2024 23:18:46 +0800 q[i - 1, j])的呢,别急,这里给出证明:若q[i] ]]>https://blog.youkuaiyun.com/ResCells/article/details/142645000https://blog.youkuaiyun.com/ResCells/article/details/142645000ResCellsSun, 06 Oct 2024 15:58:49 +0800代表了答案具有。二分查找想必大家一定都不陌生吧,二分答案的一个显著特征是比较容易。但是根据题目所给的条件,会发现。二分答案的另一个显著特征就是。]]>https://blog.youkuaiyun.com/ResCells/article/details/142673590https://blog.youkuaiyun.com/ResCells/article/details/142673590ResCellsWed, 02 Oct 2024 10:43:16 +0800为什么01背包有一个。发现多重背包就可以从正面枚举到后面,比较大小,这样就实现了上述表达式;其实是这样的:当完全背包的。是从后面往前面枚举的,]]>https://blog.youkuaiyun.com/ResCells/article/details/142622812https://blog.youkuaiyun.com/ResCells/article/details/142622812ResCellsSat, 28 Sep 2024 22:31:15 +0800https://blog.youkuaiyun.com/ResCells/article/details/142590861https://blog.youkuaiyun.com/ResCells/article/details/142590861ResCellsFri, 27 Sep 2024 13:02:01 +0800https://blog.youkuaiyun.com/ResCells/article/details/142536484https://blog.youkuaiyun.com/ResCells/article/details/142536484ResCellsThu, 26 Sep 2024 10:54:01 +0800https://blog.youkuaiyun.com/ResCells/article/details/142449788https://blog.youkuaiyun.com/ResCells/article/details/142449788ResCellsMon, 23 Sep 2024 10:04:18 +0800一开始我的想法就是枚举每一个可能的左区间。根据题目的意思,我们是需要检查在范围。,并且计算以该点为左区间的整个区间。]]>https://blog.youkuaiyun.com/ResCells/article/details/126475322https://blog.youkuaiyun.com/ResCells/article/details/126475322ResCellsTue, 23 Aug 2022 21:25:56 +0800https://blog.youkuaiyun.com/ResCells/article/details/126474209https://blog.youkuaiyun.com/ResCells/article/details/126474209ResCellsMon, 22 Aug 2022 21:40:02 +0800https://blog.youkuaiyun.com/ResCells/article/details/126436063https://blog.youkuaiyun.com/ResCells/article/details/126436063ResCellsSat, 20 Aug 2022 11:11:42 +0800https://blog.youkuaiyun.com/ResCells/article/details/126379435https://blog.youkuaiyun.com/ResCells/article/details/126379435ResCellsWed, 17 Aug 2022 14:54:15 +0800https://blog.youkuaiyun.com/ResCells/article/details/126348465https://blog.youkuaiyun.com/ResCells/article/details/126348465ResCellsMon, 15 Aug 2022 16:58:52 +0800https://blog.youkuaiyun.com/ResCells/article/details/126343316https://blog.youkuaiyun.com/ResCells/article/details/126343316ResCellsMon, 15 Aug 2022 11:35:36 +0800https://blog.youkuaiyun.com/ResCells/article/details/126299683https://blog.youkuaiyun.com/ResCells/article/details/126299683ResCellsFri, 12 Aug 2022 11:03:38 +0800