<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qq_56326461的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_56326461</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_56326461]]></copyright><item><title><![CDATA[Hall 定理学习笔记]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/148885060</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/148885060</guid><author>qq_56326461</author><pubDate>Wed, 25 Jun 2025 09:33:11 +0800</pubDate><description><![CDATA[对于一张二分图GVEG=(V,E)GVE，设其左右部点集分别为VLVRV_L,V_RVL​VR​，不妨认为∣VL∣≤∣VR∣∣VL​∣≤∣VR​∣，定义该二分图的一组完备匹配为左部∣VL∣|V_L|∣VL​∣个点全部成为匹配点的匹配。Hall 定理讲的是，定义NvN(v)Nv为节点vvv的邻居集，如果对于任意S⊆VLS⊆VL​，均有∣S∣≤∣⋃u∈SNu∣∣S。]]></description><category></category></item><item><title><![CDATA[Dilworth 定理小记]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/148831669</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/148831669</guid><author>qq_56326461</author><pubDate>Wed, 25 Jun 2025 08:22:37 +0800</pubDate><description><![CDATA[感觉这部分知识在数学里是非常深奥的一个分支，但由于时间有限只能简单记录一下它在 OI 中的部分应用。首先要明白偏序集若集合SSS中的一个二元关系∗∗满足自反性，传递性，反对称性，则称SSS为一偏序集，∗∗为SSS上的一个偏序关系a∗aa*aa∗a成立a∗bb∗c→a∗ca∗bb∗c→a∗ca∗bb∗a→aba∗bb∗a→ab用图论的语言去刻画偏序集的话得到的就是一张传递闭包后的DAGDAGDA。]]></description><category></category></item><item><title><![CDATA[Prufer 序列小记]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/148695196</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/148695196</guid><author>qq_56326461</author><pubDate>Mon, 16 Jun 2025 21:46:36 +0800</pubDate><description><![CDATA[Prufer 序列是一种将一棵用一个唯一的整数序列表示的方法，本质上它做到了树与序列的双射，从而让我们能够方便的在序列上刻画一些树的性质。以下讨论中不考虑树的节点数n1的情况。]]></description><category></category></item><item><title><![CDATA[SD二轮省集总结]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/147723200</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/147723200</guid><author>qq_56326461</author><pubDate>Fri, 09 May 2025 11:44:37 +0800</pubDate><description><![CDATA[SD二轮省集]]></description><category></category></item><item><title><![CDATA[FWT (快速沃尔什变换) 学习笔记]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/144040714</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/144040714</guid><author>qq_56326461</author><pubDate>Sun, 06 Apr 2025 15:46:38 +0800</pubDate><description><![CDATA[神奇 FWT]]></description><category></category></item><item><title><![CDATA[多项式全家桶]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/146678153</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/146678153</guid><author>qq_56326461</author><pubDate>Sat, 29 Mar 2025 17:33:30 +0800</pubDate><description><![CDATA[用 F(x)=∑i=0fixiF(x)=\sum\limits_{i=0} f_i x^iF(x)=i=0∑​fi​xi 表示一个多项式，用 [xn]F(x)=fn[x^n]F(x)=f_n[xn]F(x)=fn​ 表示 F(x)F(x)F(x) 第 nnn 项系数。设 nnn 为最大的非零的 fnf_nfn​，那么 F(x)F(x)F(x) 的次数为 nnn ，记作 deg⁡(F(x))=n\deg(F(x))=ndeg(F(x))=n，注意 nnn 次多项式有 n+1n+1n+1 项。多项式加法：F(x]]></description><category></category></item><item><title><![CDATA[NOI 2022 攻略]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/146555176</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/146555176</guid><author>qq_56326461</author><pubDate>Thu, 27 Mar 2025 16:00:56 +0800</pubDate><description><![CDATA[从分数线上来看是比较困难的一年 NOI 了，十分考验选手的实力和心态先不考虑 333 操作查询，怎么维护序列呢？末尾加，删；合并两个序列，容易让人想到链表，这些操作链表都可以处理接下来考虑怎么查询，我们直接对每个序列维护一棵值域线段树，如果是查一个序列的绝对众数的话，可以在线段树上二分，每次比较左右儿子的数字个数，递归到大的那一边，由绝对众数的定义这样最终肯定是能找到的对于查多个序列，我们把每次询问的 mmm 棵值域线段树的根拿出来，计算所有左儿子以及所有右儿子的和，然后一起往左或者右儿子走就行了因为是值域]]></description><category></category></item><item><title><![CDATA[字符串算法深入]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/145325747</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/145325747</guid><author>qq_56326461</author><pubDate>Wed, 12 Mar 2025 21:03:01 +0800</pubDate><description><![CDATA[字符串进阶]]></description><category></category></item><item><title><![CDATA[联合省选 2025 游记]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/145952907</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/145952907</guid><author>qq_56326461</author><pubDate>Sun, 02 Mar 2025 21:22:05 +0800</pubDate><description><![CDATA[continue or break？]]></description><category></category></item><item><title><![CDATA[凸性相关问题]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/145488922</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/145488922</guid><author>qq_56326461</author><pubDate>Wed, 12 Feb 2025 22:11:22 +0800</pubDate><description><![CDATA[高妙凸性优化]]></description><category></category></item><item><title><![CDATA[2月 daimayuan 集训总结]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/145481412</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/145481412</guid><author>qq_56326461</author><pubDate>Wed, 12 Feb 2025 22:07:18 +0800</pubDate><description><![CDATA[简记。]]></description><category></category></item><item><title><![CDATA[THUWC 2025 游记]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/145123457</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/145123457</guid><author>qq_56326461</author><pubDate>Thu, 16 Jan 2025 21:04:27 +0800</pubDate><description><![CDATA[六点半的高铁，五点半就起，困飞高铁上睡眠十分不好，蚌醒来之后看了几集末日三问，呜呜太好看了中午到了全季酒店，吃完饭休息了一会就去报道了然后排队排了Onns后终于拿到了报到证，还送了清华的一些纪念品，感觉很牛接下来试机，刚开始由于键盘过于逆天，表现为键盘上space回弹过慢，敲一下出来一堆空格，赶紧申请换了屋里很热！！vscode上/下移行vscode 内打开终端删除整行，好像默认是一定要调成backspace！！然后登录了 OJ，注意事项里交代了正赛是pretest。]]></description><category></category></item><item><title><![CDATA[NOI Linux 使用小技巧]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/144964522</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/144964522</guid><author>qq_56326461</author><pubDate>Mon, 06 Jan 2025 15:32:03 +0800</pubDate><description><![CDATA[显示当前所在位置的所有子目录；的话需要在终端界面 手动输入；，在当前目录下生成一个名字为。运行这个文件，如果没有。一般来说后两个结合着看就行。]]></description><category></category></item><item><title><![CDATA[NOIP 2024 游记]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/144158834</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/144158834</guid><author>qq_56326461</author><pubDate>Sun, 01 Dec 2024 12:41:24 +0800</pubDate><description><![CDATA[一定要笑着走到最后啊。]]></description><category></category></item><item><title><![CDATA[11.25 校内模拟赛总结]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/144036571</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/144036571</guid><author>qq_56326461</author><pubDate>Mon, 25 Nov 2024 20:42:47 +0800</pubDate><description><![CDATA[难评。]]></description><category></category></item><item><title><![CDATA[11.22 校内模拟赛总结]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/143978732</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/143978732</guid><author>qq_56326461</author><pubDate>Fri, 22 Nov 2024 19:09:57 +0800</pubDate><description><![CDATA[挂分场。]]></description><category></category></item><item><title><![CDATA[11.21 小清新图论专场训练]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/143953566</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/143953566</guid><author>qq_56326461</author><pubDate>Thu, 21 Nov 2024 21:31:10 +0800</pubDate><description><![CDATA[从边的角度分析：边要么是连接不同字符，这样的边反复横跳是没意义的；还有一种套路：边数很多的时候(比如完全图)，通常可以分析出来许多边是没用的，只保留那些较优的边，再跑最小生成树算法。种元素构出的最大长度就是 不同的二元组个数，不是最大长度的话显然删掉序列末尾一定不会变得不合法。的边，可以通过反复横跳来修正中间括号匹配的限制，那么唯一的限制就是。的一条边，二元组需要全部出现，就是边要全部经过，由此想到欧拉路径。再考虑路径：简单的情况是不经过第二类边，那么路径上一定是。的，每次询问的时候现做即可，复杂度。]]></description><category></category></item><item><title><![CDATA[11.11 校内模拟赛总结]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/143695824</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/143695824</guid><author>qq_56326461</author><pubDate>Tue, 12 Nov 2024 15:26:52 +0800</pubDate><description><![CDATA[额。]]></description><category></category></item><item><title><![CDATA[11.6 校内模拟赛总结]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/143577862</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/143577862</guid><author>qq_56326461</author><pubDate>Wed, 06 Nov 2024 20:06:34 +0800</pubDate><description><![CDATA[打的很顺的一场。]]></description><category></category></item><item><title><![CDATA[11.5 daimayuan Day 4 模拟赛总结]]></title><link>https://blog.youkuaiyun.com/qq_56326461/article/details/143515759</link><guid>https://blog.youkuaiyun.com/qq_56326461/article/details/143515759</guid><author>qq_56326461</author><pubDate>Wed, 06 Nov 2024 14:44:12 +0800</pubDate><description><![CDATA[打的一般的一场。]]></description><category></category></item></channel></rss>