https://blog.youkuaiyun.com/frxnancezh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/frxnance/article/details/153741924https://blog.youkuaiyun.com/frxnance/article/details/153741924frxnanceWed, 22 Oct 2025 18:31:10 +0800https://blog.youkuaiyun.com/frxnance/article/details/153740979https://blog.youkuaiyun.com/frxnance/article/details/153740979frxnanceWed, 22 Oct 2025 18:04:43 +0800https://blog.youkuaiyun.com/frxnance/article/details/153693324https://blog.youkuaiyun.com/frxnance/article/details/153693324frxnanceTue, 21 Oct 2025 16:48:27 +0800https://blog.youkuaiyun.com/frxnance/article/details/153190269https://blog.youkuaiyun.com/frxnance/article/details/153190269frxnanceMon, 13 Oct 2025 12:56:57 +0800https://blog.youkuaiyun.com/frxnance/article/details/153189957https://blog.youkuaiyun.com/frxnance/article/details/153189957frxnanceMon, 13 Oct 2025 12:51:28 +0800https://blog.youkuaiyun.com/frxnance/article/details/153189252https://blog.youkuaiyun.com/frxnance/article/details/153189252frxnanceMon, 13 Oct 2025 12:37:51 +0800= nums[2] <= nums[3]...的形式。先排序，然后从后向前遍历，找到最大的h使得citations[i] >= h。如果当前栅栏与前一个颜色不同：dp[i] = dp[i-1] * (k-1)如果当前栅栏与前一个颜色相同：dp[i] = dp[i-2] * (k-1)​：有n个栅栏，k种颜色，要求最多连续两个栅栏颜色相同，求涂色方案数。]]>https://blog.youkuaiyun.com/frxnance/article/details/153188782https://blog.youkuaiyun.com/frxnance/article/details/153188782frxnanceMon, 13 Oct 2025 12:29:26 +0800https://blog.youkuaiyun.com/frxnance/article/details/153187202https://blog.youkuaiyun.com/frxnance/article/details/153187202frxnanceMon, 13 Oct 2025 11:50:44 +0800https://blog.youkuaiyun.com/frxnance/article/details/153186932https://blog.youkuaiyun.com/frxnance/article/details/153186932frxnanceMon, 13 Oct 2025 11:45:35 +0800https://blog.youkuaiyun.com/frxnance/article/details/153185538https://blog.youkuaiyun.com/frxnance/article/details/153185538frxnanceMon, 13 Oct 2025 11:22:42 +0800https://blog.youkuaiyun.com/frxnance/article/details/153183937https://blog.youkuaiyun.com/frxnance/article/details/153183937frxnanceMon, 13 Oct 2025 10:52:00 +0800https://blog.youkuaiyun.com/frxnance/article/details/153183615https://blog.youkuaiyun.com/frxnance/article/details/153183615frxnanceMon, 13 Oct 2025 10:45:24 +0800https://blog.youkuaiyun.com/frxnance/article/details/153182081https://blog.youkuaiyun.com/frxnance/article/details/153182081frxnanceMon, 13 Oct 2025 10:19:58 +0800https://blog.youkuaiyun.com/frxnance/article/details/152736926https://blog.youkuaiyun.com/frxnance/article/details/152736926frxnanceWed, 08 Oct 2025 21:52:32 +0800https://blog.youkuaiyun.com/frxnance/article/details/152736881https://blog.youkuaiyun.com/frxnance/article/details/152736881frxnanceWed, 08 Oct 2025 21:52:06 +0800https://blog.youkuaiyun.com/frxnance/article/details/152736653https://blog.youkuaiyun.com/frxnance/article/details/152736653frxnanceWed, 08 Oct 2025 21:48:05 +0800https://blog.youkuaiyun.com/frxnance/article/details/152736555https://blog.youkuaiyun.com/frxnance/article/details/152736555frxnanceWed, 08 Oct 2025 21:46:53 +0800https://blog.youkuaiyun.com/frxnance/article/details/152729775https://blog.youkuaiyun.com/frxnance/article/details/152729775frxnanceWed, 08 Oct 2025 18:13:50 +0800https://blog.youkuaiyun.com/frxnance/article/details/152729718https://blog.youkuaiyun.com/frxnance/article/details/152729718frxnanceWed, 08 Oct 2025 18:10:44 +0800https://blog.youkuaiyun.com/frxnance/article/details/152729184https://blog.youkuaiyun.com/frxnance/article/details/152729184frxnanceWed, 08 Oct 2025 17:45:48 +0800