https://blog.youkuaiyun.com/codemonkey_66798zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/codemonkey_66798/article/details/148961058https://blog.youkuaiyun.com/codemonkey_66798/article/details/148961058codemonkey_66798Fri, 27 Jun 2025 21:30:45 +0800https://blog.youkuaiyun.com/codemonkey_66798/article/details/148480423https://blog.youkuaiyun.com/codemonkey_66798/article/details/148480423codemonkey_66798Sat, 07 Jun 2025 18:27:40 +0800https://blog.youkuaiyun.com/codemonkey_66798/article/details/148335972https://blog.youkuaiyun.com/codemonkey_66798/article/details/148335972codemonkey_66798Fri, 30 May 2025 13:36:05 +0800https://blog.youkuaiyun.com/codemonkey_66798/article/details/148287257https://blog.youkuaiyun.com/codemonkey_66798/article/details/148287257codemonkey_66798Wed, 28 May 2025 17:31:34 +0800https://blog.youkuaiyun.com/codemonkey_66798/article/details/148282869https://blog.youkuaiyun.com/codemonkey_66798/article/details/148282869codemonkey_66798Wed, 28 May 2025 14:47:31 +0800=k，右边0的个数>=k，如果找不到就说明s一定不合法，另外，比较容易发现的一点时，最终s中0的个数一定是2k的倍数，这是因为每次执行删除操作删除2k个数。1.在整个s序列从左往右第k个0的位置i和从右往左第k个0的位置j之间，即(i,j)区间存在1。2.s中0的个数是2k的倍数。]]>https://blog.youkuaiyun.com/codemonkey_66798/article/details/148229089https://blog.youkuaiyun.com/codemonkey_66798/article/details/148229089codemonkey_66798Mon, 26 May 2025 14:42:32 +0800https://blog.youkuaiyun.com/codemonkey_66798/article/details/148148934https://blog.youkuaiyun.com/codemonkey_66798/article/details/148148934codemonkey_66798Thu, 22 May 2025 21:20:08 +0800=c_(n-1)+min和ans_n<=d_(n-1)+max是否成立：先看后者，计算d_i的过程和二分时摆放max的过程其实是一样的，所以d_(n-1)+max一定等于ans_n，又因为c_i+min<=d_i+max。ans_i取[c_i,d_i]和[红,蓝]的交集，情况有如下两种，第一种可以取ans_i=d_i，第二种可以取ans_i=蓝。设a_i与a_(i+1)之间的分界点为p_i，定义c_i,d_i，表示p_i的区间范围：c_i<=p_i<=d_i，]]>https://blog.youkuaiyun.com/codemonkey_66798/article/details/148122964https://blog.youkuaiyun.com/codemonkey_66798/article/details/148122964codemonkey_66798Wed, 21 May 2025 20:08:16 +0800https://blog.youkuaiyun.com/codemonkey_66798/article/details/148109193https://blog.youkuaiyun.com/codemonkey_66798/article/details/148109193codemonkey_66798Wed, 21 May 2025 14:39:59 +0800https://blog.youkuaiyun.com/codemonkey_66798/article/details/147835289https://blog.youkuaiyun.com/codemonkey_66798/article/details/147835289codemonkey_66798Fri, 09 May 2025 19:04:18 +0800https://blog.youkuaiyun.com/codemonkey_66798/article/details/147308736https://blog.youkuaiyun.com/codemonkey_66798/article/details/147308736codemonkey_66798Thu, 17 Apr 2025 16:23:55 +0800https://blog.youkuaiyun.com/codemonkey_66798/article/details/147276963https://blog.youkuaiyun.com/codemonkey_66798/article/details/147276963codemonkey_66798Wed, 16 Apr 2025 15:09:04 +0800https://blog.youkuaiyun.com/codemonkey_66798/article/details/146964737https://blog.youkuaiyun.com/codemonkey_66798/article/details/146964737codemonkey_66798Wed, 02 Apr 2025 21:27:04 +0800https://blog.youkuaiyun.com/codemonkey_66798/article/details/146908861https://blog.youkuaiyun.com/codemonkey_66798/article/details/146908861codemonkey_66798Tue, 01 Apr 2025 12:35:35 +0800https://blog.youkuaiyun.com/codemonkey_66798/article/details/146908384https://blog.youkuaiyun.com/codemonkey_66798/article/details/146908384codemonkey_66798Tue, 01 Apr 2025 12:08:44 +0800https://blog.youkuaiyun.com/codemonkey_66798/article/details/146773868https://blog.youkuaiyun.com/codemonkey_66798/article/details/146773868codemonkey_66798Sun, 30 Mar 2025 20:45:11 +0800https://blog.youkuaiyun.com/codemonkey_66798/article/details/146768379https://blog.youkuaiyun.com/codemonkey_66798/article/details/146768379codemonkey_66798Sun, 30 Mar 2025 16:41:00 +0800https://blog.youkuaiyun.com/codemonkey_66798/article/details/146638606https://blog.youkuaiyun.com/codemonkey_66798/article/details/146638606codemonkey_66798Sat, 29 Mar 2025 10:03:26 +0800https://blog.youkuaiyun.com/codemonkey_66798/article/details/146527847https://blog.youkuaiyun.com/codemonkey_66798/article/details/146527847codemonkey_66798Wed, 26 Mar 2025 14:24:23 +0800=i）表示前1~i个点a的值已经确定，第i+1到第j个点为1的情况下，如果j=i，那么第i个点后没有连续的1的段，前1~i个点贡献的价值。（3）是dp[i+1][从i+1到更大的数]被dp[i][从i到更大的数]更新。]]>https://blog.youkuaiyun.com/codemonkey_66798/article/details/146494197https://blog.youkuaiyun.com/codemonkey_66798/article/details/146494197codemonkey_66798Tue, 25 Mar 2025 09:32:31 +0800