<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[supreme567的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/supreme567</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; supreme567]]></copyright><item><title><![CDATA[2024年美团春招技术岗第一批笔试]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/147466702</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/147466702</guid><author>supreme567</author><pubDate>Thu, 24 Apr 2025 01:32:43 +0800</pubDate><description><![CDATA[【代码】2024年美团春招技术岗第一批笔试。]]></description><category></category></item><item><title><![CDATA[轻重链剖分+启发式合并专题]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/133910339</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/133910339</guid><author>supreme567</author><pubDate>Thu, 19 Oct 2023 05:56:41 +0800</pubDate><description><![CDATA[一棵根为1 的树，每条边上有一个字符（a-v共22种）。一条简单路径被称为Dokhtar-kosh当且仅当路径上的字符经过重新排序后可以变成一个回文串。求每个子树中最长的Dokhtar-kosh路径的长度。给你n个点构成的一棵树，树里面的每一条边有一个权值，求出每个子树里面能通过重排构成回文串的最大路径长度.]]></description><category></category></item><item><title><![CDATA[2023年8月初补题]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/132074883</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/132074883</guid><author>supreme567</author><pubDate>Sun, 06 Aug 2023 20:26:06 +0800</pubDate><description><![CDATA[补题]]></description><category></category></item><item><title><![CDATA[2023牛客多校第三场]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/132071737</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/132071737</guid><author>supreme567</author><pubDate>Wed, 02 Aug 2023 21:16:33 +0800</pubDate><description><![CDATA[需要前缀和优化+滚动数组。]]></description><category></category></item><item><title><![CDATA[2023牛客多校训练第五场铜银牌题解]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/132037072</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/132037072</guid><author>supreme567</author><pubDate>Tue, 01 Aug 2023 10:37:48 +0800</pubDate><description><![CDATA[2023牛客多校训练第五场铜银牌题解]]></description><category></category></item><item><title><![CDATA[蓝桥杯成绩排名后续]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/130315706</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/130315706</guid><author>supreme567</author><pubDate>Sun, 23 Apr 2023 10:14:35 +0800</pubDate><description><![CDATA[省流：A组C++ 广东省 省一]]></description><category></category></item><item><title><![CDATA[第14届蓝桥杯C++A组题解]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/130027829</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/130027829</guid><author>supreme567</author><pubDate>Sat, 08 Apr 2023 13:42:32 +0800</pubDate><description><![CDATA[题解]]></description><category></category></item><item><title><![CDATA[ccf-csp各期第4题题解]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/129629813</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/129629813</guid><author>supreme567</author><pubDate>Sun, 19 Mar 2023 03:30:36 +0800</pubDate><description><![CDATA[周日就要打csp了，赶紧来复习一下。]]></description><category></category></item><item><title><![CDATA[计算机笔试题题解]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/129561124</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/129561124</guid><author>supreme567</author><pubDate>Fri, 17 Mar 2023 02:48:02 +0800</pubDate><description><![CDATA[笔试题记录]]></description><category></category></item><item><title><![CDATA[牛客练习赛109（5题rk27）]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/129310129</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/129310129</guid><author>supreme567</author><pubDate>Thu, 02 Mar 2023 22:05:17 +0800</pubDate><description><![CDATA[牛客练习赛109]]></description><category></category></item><item><title><![CDATA[leetcode刷穿杂题]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/129273422</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/129273422</guid><author>supreme567</author><pubDate>Wed, 01 Mar 2023 10:25:52 +0800</pubDate><description><![CDATA[leetcode]]></description><category></category></item><item><title><![CDATA[MIT6.S081]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/129171797</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/129171797</guid><author>supreme567</author><pubDate>Thu, 23 Feb 2023 17:17:44 +0800</pubDate><description><![CDATA[MIT6.S081]]></description><category></category></item><item><title><![CDATA[2023csoj寒假训练10]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/129049130</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/129049130</guid><author>supreme567</author><pubDate>Wed, 15 Feb 2023 19:28:21 +0800</pubDate><description><![CDATA[题解]]></description><category></category></item><item><title><![CDATA[2023年1月训练计划]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/128527337</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/128527337</guid><author>supreme567</author><pubDate>Fri, 06 Jan 2023 14:07:46 +0800</pubDate><description><![CDATA[1]]></description><category></category></item><item><title><![CDATA[atcoder dp题单刷穿]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/128531664</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/128531664</guid><author>supreme567</author><pubDate>Tue, 03 Jan 2023 14:31:05 +0800</pubDate><description><![CDATA[atcoder dp题单题解]]></description><category></category></item><item><title><![CDATA[abc280]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/128175404</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/128175404</guid><author>supreme567</author><pubDate>Sun, 04 Dec 2022 18:52:07 +0800</pubDate><description><![CDATA[abc280]]></description><category></category></item><item><title><![CDATA[牛客练习赛106]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/128171148</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/128171148</guid><author>supreme567</author><pubDate>Sun, 04 Dec 2022 13:31:49 +0800</pubDate><description><![CDATA[牛客练习赛106]]></description><category></category></item><item><title><![CDATA[dsu on tree]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/127711756</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/127711756</guid><author>supreme567</author><pubDate>Sun, 06 Nov 2022 03:56:32 +0800</pubDate><description><![CDATA[dsu]]></description><category></category></item><item><title><![CDATA[ACM--虚树]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/127599365</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/127599365</guid><author>supreme567</author><pubDate>Fri, 04 Nov 2022 16:31:31 +0800</pubDate><description><![CDATA[虚树-acm]]></description><category></category></item><item><title><![CDATA[ACM--LCT]]></title><link>https://blog.youkuaiyun.com/supreme567/article/details/127623917</link><guid>https://blog.youkuaiyun.com/supreme567/article/details/127623917</guid><author>supreme567</author><pubDate>Tue, 01 Nov 2022 14:48:44 +0800</pubDate><description><![CDATA[LCT二刷]]></description><category></category></item></channel></rss>