<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[m0_73674034的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/m0_73674034</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; m0_73674034]]></copyright><item><title><![CDATA[[ZJOI2008] 骑士]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/130779330</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/130779330</guid><author>m0_73674034</author><pubDate>Sat, 20 May 2023 11:26:12 +0800</pubDate><description><![CDATA[有个n个骑士,每个骑士都有且仅有一个自己最厌恶的骑士,现在需要选出一批骑士,要求每个骑士在其中都不会碰上自己最厌恶的骑士,请输出能有的最大战力和。1.首先该题和没有上司的舞会非常相似,可以逆序查找讨厌当前骑士的所有骑士,靠构造带根节点的数来求出每个连通块的最大战力。解决:可以发现每个连通块有且仅有一个环,通过拆环可以把连通块构造成想要的树形。2.遇到的问题: 环。]]></description><category></category></item><item><title><![CDATA[L2-002 链表去重]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/130133172</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/130133172</guid><author>m0_73674034</author><pubDate>Thu, 13 Apr 2023 16:25:16 +0800</pubDate><description><![CDATA[给定一个带整数键值的链表 L，你需要把其中绝对值重复的键值结点删掉。即对每个键值 K，只有第一个绝对值等于 K 的结点被保留。同时，所有被删除的结点须被保存在另一个链表上。例如给定 L 为 21→-15→-15→-7→15，你需要输出去重后的链表 21→-15→-7，还有被删除的链表 -15→15。]]></description><category></category></item><item><title><![CDATA[周报(自看)]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/130070983</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/130070983</guid><author>m0_73674034</author><pubDate>Mon, 10 Apr 2023 21:59:14 +0800</pubDate><description><![CDATA[主要是树状数组和dp的题目,其他为cf和蓝桥杯的赛题。打两次cf,参加蓝桥杯省,刷dp和树状数组题目。线性dp,区间dp和树状数组及一点点树形dp。]]></description><category></category></item><item><title><![CDATA[周报(自看)]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129941252</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129941252</guid><author>m0_73674034</author><pubDate>Mon, 03 Apr 2023 22:20:26 +0800</pubDate><description><![CDATA[周报(自看)]]></description><category></category></item><item><title><![CDATA[周报(自看)]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129804924</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129804924</guid><author>m0_73674034</author><pubDate>Mon, 27 Mar 2023 21:54:41 +0800</pubDate><description><![CDATA[完成了trie专题的题单,参加蓝桥杯模拟赛,多做了几道kmp的题目。主要是trie专题和kmp专题的题目。trie专题和kmp专题的题目。]]></description><category></category></item><item><title><![CDATA[KMP算法专题题解]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129694728</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129694728</guid><author>m0_73674034</author><pubDate>Wed, 22 Mar 2023 21:24:01 +0800</pubDate><description><![CDATA[kmp对应题目题解]]></description><category></category></item><item><title><![CDATA[导弹拦截(O(nlogn)的做法)]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129686153</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129686153</guid><author>m0_73674034</author><pubDate>Tue, 21 Mar 2023 13:34:42 +0800</pubDate><description><![CDATA[题目的优化解法]]></description><category></category></item><item><title><![CDATA[周报(自看)]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129658446</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129658446</guid><author>m0_73674034</author><pubDate>Sun, 19 Mar 2023 23:11:04 +0800</pubDate><description><![CDATA[周报]]></description><category></category></item><item><title><![CDATA[KMP算法]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129432521</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129432521</guid><author>m0_73674034</author><pubDate>Sun, 19 Mar 2023 22:55:17 +0800</pubDate><description><![CDATA[KMP算法讲解和多题目的演练运用]]></description><category></category></item><item><title><![CDATA[Corporate Identity(最长公共子串)]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129640837</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129640837</guid><author>m0_73674034</author><pubDate>Sat, 18 Mar 2023 19:06:13 +0800</pubDate><description><![CDATA[最长公共子串的kmp求解]]></description><category></category></item><item><title><![CDATA[Theme Section(字符串的自匹配)]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129637315</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129637315</guid><author>m0_73674034</author><pubDate>Sat, 18 Mar 2023 15:17:57 +0800</pubDate><description><![CDATA[借助kmp中的next[]数组来优化搜索]]></description><category></category></item><item><title><![CDATA[Wow! Such Doge(简单的kmp练手题)]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129633186</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129633186</guid><author>m0_73674034</author><pubDate>Sat, 18 Mar 2023 10:44:16 +0800</pubDate><description><![CDATA[kmp算法练手题题解]]></description><category></category></item><item><title><![CDATA[Compress Words(前后缀匹配-＞kmp算法)]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129628426</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129628426</guid><author>m0_73674034</author><pubDate>Fri, 17 Mar 2023 21:26:14 +0800</pubDate><description><![CDATA[kmp模板实操]]></description><category></category></item><item><title><![CDATA[Barn Echoes G(洛谷p2957)]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129594993</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129594993</guid><author>m0_73674034</author><pubDate>Thu, 16 Mar 2023 18:34:10 +0800</pubDate><description><![CDATA[hash模板题]]></description><category></category></item><item><title><![CDATA[Three Friends(洛谷p6739)]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129590699</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129590699</guid><author>m0_73674034</author><pubDate>Thu, 16 Mar 2023 16:46:10 +0800</pubDate><description><![CDATA[字符串操作]]></description><category></category></item><item><title><![CDATA[字符串哈希(洛谷P3370)]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129582695</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129582695</guid><author>m0_73674034</author><pubDate>Thu, 16 Mar 2023 11:26:51 +0800</pubDate><description><![CDATA[hash模板题]]></description><category></category></item><item><title><![CDATA[Long Long Message(二分+hash的字串查找)]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129540993</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129540993</guid><author>m0_73674034</author><pubDate>Tue, 14 Mar 2023 21:49:34 +0800</pubDate><description><![CDATA[题意:
给出两个字符串s,t,求最大公共子串的长度k
思路:

二分求最大长度k
预处理s字符串长度为k的字串的hash值,放入一数组w[]后做排序
依次处理t字符串长度为k的字串的hash值,在w[]中查找是否有相同值,若有则条件满足

过程错点:
放入的数组使用set,由于插入数据量过大导致TL
_解决:使用普通数组,元素全部放入后再做排序
代码:
#include &lt;iostream&gt;
#include&lt;map&gt;
#include&lt;set&gt;
#include&lt;]]></description><category></category></item><item><title><![CDATA[Crazy Search(hash使用)]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129536470</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129536470</guid><author>m0_73674034</author><pubDate>Tue, 14 Mar 2023 18:47:02 +0800</pubDate><description><![CDATA[求字符串所有前缀hash值,查询所有长度为N的子字符串的hash值,去重求个数。输入一字符串,求其中长度为N的子字符串(去重后)有几个。]]></description><category></category></item><item><title><![CDATA[周报(自看)]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129481431</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129481431</guid><author>m0_73674034</author><pubDate>Sun, 12 Mar 2023 21:27:17 +0800</pubDate><description><![CDATA[周报总结]]></description><category></category></item><item><title><![CDATA[Road Reform(加条件的最小生成树)]]></title><link>https://blog.youkuaiyun.com/m0_73674034/article/details/129424887</link><guid>https://blog.youkuaiyun.com/m0_73674034/article/details/129424887</guid><author>m0_73674034</author><pubDate>Thu, 09 Mar 2023 16:38:21 +0800</pubDate><description><![CDATA[cf1468J题.Rode Reform题解]]></description><category></category></item></channel></rss>