<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[rising_funny的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/rising_funny</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; rising_funny]]></copyright><item><title><![CDATA[CSP-S2026 大区游记]]></title><link>https://blog.youkuaiyun.com/rising_funny/article/details/169735436</link><guid>https://blog.youkuaiyun.com/rising_funny/article/details/169735436</guid><author>rising_funny</author><pubDate>Sun, 01 Nov 2026 11:22:13 +0800</pubDate><description><![CDATA[我去，牢美的 NASA 这么厉害，居然把我给探测出来了！]]></description><category></category></item><item><title><![CDATA[P15265 [USACO26JAN2] Dynamic Instability P 自学式题解]]></title><link>https://blog.youkuaiyun.com/rising_funny/article/details/163368902</link><guid>https://blog.youkuaiyun.com/rising_funny/article/details/163368902</guid><author>rising_funny</author><pubDate>Fri, 31 Jul 2026 15:25:37 +0800</pubDate><description><![CDATA[fxdegx​xdepx​xAx​x大期望，因为我不大会这种东西所以自己重新推一边顺便写篇题解，洛谷题解已经说的很明白了所以这篇不发洛谷。换为等价的操作：一个非叶子节点往下走，而往上跳的过程拆成一步一步不花时间的，在x点有depx​1​的概率停下，而那一秒在叶子节点加进去就可以了。这样根据古典概型经典结论跟原问题是等价的。设从根节点走到x节点期望时间为Ex​，从父节点走到x的期望时间为downx​，则有Ex​Ef​down。]]></description><category></category></item><item><title><![CDATA[LOJ#6913. 树莓立方体自学式题解]]></title><link>https://blog.youkuaiyun.com/rising_funny/article/details/163310320</link><guid>https://blog.youkuaiyun.com/rising_funny/article/details/163310320</guid><author>rising_funny</author><pubDate>Wed, 29 Jul 2026 17:38:43 +0800</pubDate><description><![CDATA[原题链接：https://loj.ac/p/6913。]]></description><category></category></item><item><title><![CDATA[洛谷P11288 [COTS 2017] 模板 Z1 自学式题解]]></title><link>https://blog.youkuaiyun.com/rising_funny/article/details/163085636</link><guid>https://blog.youkuaiyun.com/rising_funny/article/details/163085636</guid><author>rising_funny</author><pubDate>Tue, 21 Jul 2026 20:26:22 +0800</pubDate><description><![CDATA[集训第一次 CSP-S 模拟赛 T4，我认为 too hard，写一篇题解以巩固我自己的理解。可能也算低手向题解？？？模拟赛题是1≤nh≤109的，所以本篇题解的算法复杂度为Omlogm。对比原题，模拟赛给了h2的部分分，以启发我们入手，因此沿用下模拟赛给的子任务。下面值域全部写成闭区间1h。。]]></description><category></category></item><item><title><![CDATA[U703133 惊鹊 出题报告]]></title><link>https://blog.youkuaiyun.com/rising_funny/article/details/162881348</link><guid>https://blog.youkuaiyun.com/rising_funny/article/details/162881348</guid><author>rising_funny</author><pubDate>Tue, 14 Jul 2026 20:25:39 +0800</pubDate><description><![CDATA[题面：https://www.luogu.com.cn/problem/U703133。]]></description><category></category></item><item><title><![CDATA[洛谷P13273 [NOI2025] 数字树 题解]]></title><link>https://blog.youkuaiyun.com/rising_funny/article/details/162148502</link><guid>https://blog.youkuaiyun.com/rising_funny/article/details/162148502</guid><author>rising_funny</author><pubDate>Sat, 20 Jun 2026 15:21:24 +0800</pubDate><description><![CDATA[题目保证存在一种合法方案，我们可以考虑由一个合法方案怎么调整出不同的合法方案。为了方便理解，我们钦定优先向左遍历，把换向操作转换成翻转子树的操作。容易发现，翻转一棵子树时已经合法匹配的点不受影响，那么只有那些当前未配对的点需要考虑。跟虚树的角度差不多，我们把这些子树内已经匹配上的点踢掉分析。分析问题的重要方法：从小入手。]]></description><category></category></item><item><title><![CDATA[洛谷P14637 [NOIP2025] 树的价值题解与碎碎念]]></title><link>https://blog.youkuaiyun.com/rising_funny/article/details/161862750</link><guid>https://blog.youkuaiyun.com/rising_funny/article/details/161862750</guid><author>rising_funny</author><pubDate>Wed, 10 Jun 2026 15:00:06 +0800</pubDate><description><![CDATA[OnmO(nm)Onm我们不难发现还是计算了冗余数据。对于固定链长，我们明明只想知道对应深度的答案，而我们却把这层点全跑了一遍，难道不能把一层点的信息全压在一起吗？聪明的你一定想到了线段树合并OK 写完发现常数过大直接喜提跟Onm2O(nm^2)Onm2一样的分。那怎么办？使用神秘指针科技之长链剖分。设SuiS[u][i]Sui表示uuu子树子树内深度为iii这一整层点在计算guig[u][i]gui时的贡献。有转移Suimax⁡v。]]></description><category></category></item><item><title><![CDATA[Slope Trick学习笔记]]></title><link>https://blog.youkuaiyun.com/rising_funny/article/details/160260609</link><guid>https://blog.youkuaiyun.com/rising_funny/article/details/160260609</guid><author>rising_funny</author><pubDate>Fri, 17 Apr 2026 22:48:36 +0800</pubDate><description><![CDATA[这题是 CF13C 的数据加强版。]]></description><category></category></item><item><title><![CDATA[[Eloi Easy Round 2026] 与你相恋直到生命尽头 出题报告]]></title><link>https://blog.youkuaiyun.com/rising_funny/article/details/159292795</link><guid>https://blog.youkuaiyun.com/rising_funny/article/details/159292795</guid><author>rising_funny</author><pubDate>Sat, 21 Mar 2026 00:11:15 +0800</pubDate><description><![CDATA[首先这是个傻子卡常题，反正我出着玩的。题面：https://www.luogu.com.cn/problem/U669230。]]></description><category></category></item><item><title><![CDATA[数量性状遗传比例系数杨辉三角证明/基因重组出题报告]]></title><link>https://blog.youkuaiyun.com/rising_funny/article/details/159292447</link><guid>https://blog.youkuaiyun.com/rising_funny/article/details/159292447</guid><author>rising_funny</author><pubDate>Sat, 21 Mar 2026 00:09:48 +0800</pubDate><description><![CDATA[题面：https://www.luogu.com.cn/problem/U670861。]]></description><category></category></item><item><title><![CDATA[(数学)好玩没啥用的解题方法(1)]]></title><link>https://blog.youkuaiyun.com/rising_funny/article/details/154576112</link><guid>https://blog.youkuaiyun.com/rising_funny/article/details/154576112</guid><author>rising_funny</author><pubDate>Sat, 08 Nov 2025 17:58:18 +0800</pubDate><description><![CDATA[众所周知曼哈顿距离有个性质：与某点等曼哈顿距离的点集为斜。个大手子会不知道曼哈顿距离以及其性质直接构造直线）（其实曼哈顿距离只是思路的引子，没有什么必要性）因此问题转化为设直线。]]></description><category></category></item><item><title><![CDATA[(c++)Rnumber分数类模板，算法竞赛用]]></title><link>https://blog.youkuaiyun.com/rising_funny/article/details/154545190</link><guid>https://blog.youkuaiyun.com/rising_funny/article/details/154545190</guid><author>rising_funny</author><pubDate>Fri, 07 Nov 2025 23:02:50 +0800</pubDate><description><![CDATA[rt支持分数间加减乘除，以及分数和小数的加减乘除，还有输入输出重载。a是分子，b是分母，如果b=0会exit(486)表示错误。分数的符号以分子的正负号表示。可以用这个去水掉NOIP2020T1（记得开__int128。]]></description><category></category></item><item><title><![CDATA[论如何用同余妙证集合之间的关系]]></title><link>https://blog.youkuaiyun.com/rising_funny/article/details/148956451</link><guid>https://blog.youkuaiyun.com/rising_funny/article/details/148956451</guid><author>rising_funny</author><pubDate>Fri, 27 Jun 2025 16:48:55 +0800</pubDate><description><![CDATA[论如何用同余妙证集合之间的关系]]></description><category></category></item><item><title><![CDATA[氯酸钠提纯与产率提高解决方案（理论计算）——溶度积的典型应用]]></title><link>https://blog.youkuaiyun.com/rising_funny/article/details/147905346</link><guid>https://blog.youkuaiyun.com/rising_funny/article/details/147905346</guid><author>rising_funny</author><pubDate>Mon, 12 May 2025 21:33:19 +0800</pubDate><description><![CDATA[对于粗略制备氯酸钠，cod去除剂是个不错的选择。]]></description><category></category></item><item><title><![CDATA[一元n次方程求根算法]]></title><link>https://blog.youkuaiyun.com/rising_funny/article/details/146214188</link><guid>https://blog.youkuaiyun.com/rising_funny/article/details/146214188</guid><author>rising_funny</author><pubDate>Wed, 12 Mar 2025 20:29:53 +0800</pubDate><description><![CDATA[这是我于2025.3.11在椅子上躺着玩手机突然想到的，由于思路过于简单感觉几百年前就有人想到了，当deepseek找类似文章没找到，自己又不会找，并且想记录一下，于是有了这篇博客该算法有很大的精度缺陷，且没有时间复杂度的严格推导（因为我不会），要是能提出改进建议或者彻底否定我将感激不尽。]]></description><category></category></item></channel></rss>