<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[m0_73666576的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/m0_73666576</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; m0_73666576]]></copyright><item><title><![CDATA[CS144 Lab【0~4】]]></title><link>https://blog.youkuaiyun.com/m0_73666576/article/details/141932343</link><guid>https://blog.youkuaiyun.com/m0_73666576/article/details/141932343</guid><author>m0_73666576</author><pubDate>Tue, 10 Sep 2024 16:35:37 +0800</pubDate><description><![CDATA[CS144Lab]]></description><category></category></item><item><title><![CDATA[最短路问题]]></title><link>https://blog.youkuaiyun.com/m0_73666576/article/details/139292894</link><guid>https://blog.youkuaiyun.com/m0_73666576/article/details/139292894</guid><author>m0_73666576</author><pubDate>Wed, 29 May 2024 14:51:56 +0800</pubDate><description><![CDATA[超详细的最短路问题]]></description><category></category></item><item><title><![CDATA[回文自动机（PAM）]]></title><link>https://blog.youkuaiyun.com/m0_73666576/article/details/138141685</link><guid>https://blog.youkuaiyun.com/m0_73666576/article/details/138141685</guid><author>m0_73666576</author><pubDate>Wed, 24 Apr 2024 13:13:09 +0800</pubDate><description><![CDATA[回文自动机PAM]]></description><category></category></item><item><title><![CDATA[字符串哈希+例题及其应用]]></title><link>https://blog.youkuaiyun.com/m0_73666576/article/details/137980576</link><guid>https://blog.youkuaiyun.com/m0_73666576/article/details/137980576</guid><author>m0_73666576</author><pubDate>Sat, 20 Apr 2024 00:31:46 +0800</pubDate><description><![CDATA[想一下如果要比较/查询两个字符串并且这两个字符串规模很大，显然如果逐一比对字符串的字符效率就会很低，这个时候哈希就可以很快的解决这类问题，哈希就是将每一个字符串赋一个对应的数字值，这样比如说我们想看两个字符串是否相等，我们直接去看它对应的值是否相等即可，这样在预处理后我们就将每次的查询变成了O(1)！那么怎么得到这个对应的数字值呢？下面来看一下。]]></description><category></category></item><item><title><![CDATA[树分治-点分治（超级易懂版）]]></title><link>https://blog.youkuaiyun.com/m0_73666576/article/details/137200873</link><guid>https://blog.youkuaiyun.com/m0_73666576/article/details/137200873</guid><author>m0_73666576</author><pubDate>Sun, 31 Mar 2024 16:49:22 +0800</pubDate><description><![CDATA[点分治是一种基于分治思想来处理树上路径问题的算法。本文将会用较好理解的方式去分享这个算法。]]></description><category></category></item><item><title><![CDATA[树链剖分（重链剖分）]]></title><link>https://blog.youkuaiyun.com/m0_73666576/article/details/136989693</link><guid>https://blog.youkuaiyun.com/m0_73666576/article/details/136989693</guid><author>m0_73666576</author><pubDate>Sun, 24 Mar 2024 17:40:24 +0800</pubDate><description><![CDATA[本文主要针对于还没有学习过这个算法的新手同学]]></description><category></category></item></channel></rss>