<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[m0_62349134的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/m0_62349134</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; m0_62349134]]></copyright><item><title><![CDATA[带懒惰标记的非递归式线段树实现分享]]></title><link>https://blog.youkuaiyun.com/m0_62349134/article/details/146363366</link><guid>https://blog.youkuaiyun.com/m0_62349134/article/details/146363366</guid><author>m0_62349134</author><pubDate>Wed, 19 Mar 2025 10:54:29 +0800</pubDate><description><![CDATA[现在主流的线段树应该是带懒惰标记的递归式线段树和标记永久化的非递归式线段树？这里介绍个“杂交产物”。]]></description><category></category></item><item><title><![CDATA[Codeforces Round 964 (Div. 4) (A - G2)]]></title><link>https://blog.youkuaiyun.com/m0_62349134/article/details/140969564</link><guid>https://blog.youkuaiyun.com/m0_62349134/article/details/140969564</guid><author>m0_62349134</author><pubDate>Wed, 07 Aug 2024 01:47:02 +0800</pubDate><description><![CDATA[由于区间的值域在 2e5 以内，所以可以预处理每个数的除三次数，然后用前缀和优化一下，这样除三的次数就搞定了。当然是直接对当前的区间的左端点除三了，其产生的乘三次数也是当前区间内所有数字中最小的。有一把尺子在 [2,999] 的范围内遗失了一个刻度 x ，对于测量的长度 len ，如果小于 x ，测量结果是 len ，如果大于等于 x ，测量结果是 len+1。给定一个长度为 n 的 01 数组 a ，对其中所有长度为 k (奇数)的子序列的中位数求和，输出求和后对 1e9+7 取模的结果。]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 352 A-F]]></title><link>https://blog.youkuaiyun.com/m0_62349134/article/details/138454062</link><guid>https://blog.youkuaiyun.com/m0_62349134/article/details/138454062</guid><author>m0_62349134</author><pubDate>Sun, 05 May 2024 00:12:08 +0800</pubDate><description><![CDATA[AtCoder Beginner Contest 352 A-F]]></description><category></category></item><item><title><![CDATA[线性筛法（大概可能通俗易懂）]]></title><link>https://blog.youkuaiyun.com/m0_62349134/article/details/132892186</link><guid>https://blog.youkuaiyun.com/m0_62349134/article/details/132892186</guid><author>m0_62349134</author><pubDate>Thu, 14 Sep 2023 22:55:57 +0800</pubDate><description><![CDATA[线性筛法的简单证明与讲解]]></description><category></category></item><item><title><![CDATA[Codeforces Round 881 (Div. 3)A~E]]></title><link>https://blog.youkuaiyun.com/m0_62349134/article/details/131318545</link><guid>https://blog.youkuaiyun.com/m0_62349134/article/details/131318545</guid><author>m0_62349134</author><pubDate>Wed, 21 Jun 2023 01:28:43 +0800</pubDate><description><![CDATA[Codeforces Round 881 (Div. 3) A~E 题解]]></description><category></category></item><item><title><![CDATA[线性筛法（大概可能通俗易懂）]]></title><link>https://blog.youkuaiyun.com/m0_62349134/article/details/128422938</link><guid>https://blog.youkuaiyun.com/m0_62349134/article/details/128422938</guid><author>m0_62349134</author><pubDate>Fri, 23 Dec 2022 22:21:51 +0800</pubDate><description><![CDATA[主要问题在于如何筛选不遗漏，不重复，以及保证枚举最小因子。
结论：将每一轮进行筛选的数 n 表示为i * prime[ j ] (即 n = i * prime[ j ])。保证i 为 n 的最大因子，prime[ j ] 为 n 的最小因子。]]></description><category></category></item><item><title><![CDATA[N阶行列式求值的详细讲解(C语言)(降阶法)(函数递归)]]></title><link>https://blog.youkuaiyun.com/m0_62349134/article/details/124652856</link><guid>https://blog.youkuaiyun.com/m0_62349134/article/details/124652856</guid><author>m0_62349134</author><pubDate>Sun, 08 May 2022 20:48:41 +0800</pubDate><description><![CDATA[一般比较常见的是3阶和4阶的行列式，3阶行列式可以很方便的直接算出结果，而4阶的行列式却无法运用和3阶行列式类似的公式直接进行计算，必须用降阶法或者其他方法来求解。]]></description><category></category></item><item><title><![CDATA[PTA.奇数值结点链表(C语言)]]></title><link>https://blog.youkuaiyun.com/m0_62349134/article/details/124238010</link><guid>https://blog.youkuaiyun.com/m0_62349134/article/details/124238010</guid><author>m0_62349134</author><pubDate>Sun, 17 Apr 2022 22:55:44 +0800</pubDate><description><![CDATA[PTA题目奇数值结点链表题解]]></description><category></category></item></channel></rss>