https://blog.youkuaiyun.com/ld851zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/ld851/article/details/147102226https://blog.youkuaiyun.com/ld851/article/details/147102226ld851Wed, 09 Apr 2025 20:47:19 +0800https://blog.youkuaiyun.com/ld851/article/details/124282542https://blog.youkuaiyun.com/ld851/article/details/124282542ld851Tue, 19 Apr 2022 20:26:01 +0800https://blog.youkuaiyun.com/ld851/article/details/122072037https://blog.youkuaiyun.com/ld851/article/details/122072037ld851Tue, 21 Dec 2021 19:57:48 +0800https://blog.youkuaiyun.com/ld851/article/details/111180179https://blog.youkuaiyun.com/ld851/article/details/111180179ld851Mon, 14 Dec 2020 17:20:45 +0800https://blog.youkuaiyun.com/ld851/article/details/82431726https://blog.youkuaiyun.com/ld851/article/details/82431726ld851Wed, 05 Sep 2018 22:14:00 +0800https://blog.youkuaiyun.com/ld851/article/details/78914086https://blog.youkuaiyun.com/ld851/article/details/78914086ld851Wed, 27 Dec 2017 16:56:17 +0800https://blog.youkuaiyun.com/ld851/article/details/78027415https://blog.youkuaiyun.com/ld851/article/details/78027415ld851Tue, 19 Sep 2017 10:46:40 +0800https://blog.youkuaiyun.com/ld851/article/details/78026690https://blog.youkuaiyun.com/ld851/article/details/78026690ld851Tue, 19 Sep 2017 09:58:52 +0800https://blog.youkuaiyun.com/ld851/article/details/77721640https://blog.youkuaiyun.com/ld851/article/details/77721640ld851Wed, 30 Aug 2017 19:52:14 +0800https://blog.youkuaiyun.com/ld851/article/details/77703462https://blog.youkuaiyun.com/ld851/article/details/77703462ld851Wed, 30 Aug 2017 10:20:02 +0800https://blog.youkuaiyun.com/ld851/article/details/77583457https://blog.youkuaiyun.com/ld851/article/details/77583457ld851Fri, 25 Aug 2017 17:27:42 +08001并且m>1)每段绳子的长度记为k[0],k[1],...,k[m].请问k[0]*k[1]*...*k[m]可能的最大乘积是多少？ 例如，当绳子的长度为8时，我们把它剪成长度分别为2,3,3的三段，此时得到的最大乘积是18. 思路：动态规划，状态转移方程为f(n)=max(f(i)*f(n]]>https://blog.youkuaiyun.com/ld851/article/details/77581569https://blog.youkuaiyun.com/ld851/article/details/77581569ld851Fri, 25 Aug 2017 17:08:54 +0800https://blog.youkuaiyun.com/ld851/article/details/77541130https://blog.youkuaiyun.com/ld851/article/details/77541130ld851Thu, 24 Aug 2017 20:18:02 +0800https://blog.youkuaiyun.com/ld851/article/details/77528635https://blog.youkuaiyun.com/ld851/article/details/77528635ld851Thu, 24 Aug 2017 12:32:48 +0800https://blog.youkuaiyun.com/ld851/article/details/77524310https://blog.youkuaiyun.com/ld851/article/details/77524310ld851Thu, 24 Aug 2017 09:57:19 +0800https://blog.youkuaiyun.com/ld851/article/details/77512795https://blog.youkuaiyun.com/ld851/article/details/77512795ld851Wed, 23 Aug 2017 22:30:23 +0800https://blog.youkuaiyun.com/ld851/article/details/77512212https://blog.youkuaiyun.com/ld851/article/details/77512212ld851Wed, 23 Aug 2017 21:33:36 +0800https://blog.youkuaiyun.com/ld851/article/details/77509655https://blog.youkuaiyun.com/ld851/article/details/77509655ld851Wed, 23 Aug 2017 18:57:47 +0800https://blog.youkuaiyun.com/ld851/article/details/77507737https://blog.youkuaiyun.com/ld851/article/details/77507737ld851Wed, 23 Aug 2017 16:30:08 +0800https://blog.youkuaiyun.com/ld851/article/details/77483129https://blog.youkuaiyun.com/ld851/article/details/77483129ld851Tue, 22 Aug 2017 17:32:07 +0800