<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[beihais的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/beihais</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; beihais]]></copyright><item><title><![CDATA[Socks(并查集)]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/135250033</link><guid>https://blog.youkuaiyun.com/beihais/article/details/135250033</guid><author>beihais</author><pubDate>Wed, 27 Dec 2023 16:44:07 +0800</pubDate><description><![CDATA[【代码】Socks(并查集)]]></description><category></category></item><item><title><![CDATA[问题 G: 三三得九(数学、前缀和)]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/135116372</link><guid>https://blog.youkuaiyun.com/beihais/article/details/135116372</guid><author>beihais</author><pubDate>Wed, 20 Dec 2023 20:04:59 +0800</pubDate><description><![CDATA[【代码】问题 G: 三三得九(数学、前缀和)]]></description><category></category></item><item><title><![CDATA[水陆距离(多源BFS)]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/134908233</link><guid>https://blog.youkuaiyun.com/beihais/article/details/134908233</guid><author>beihais</author><pubDate>Sun, 10 Dec 2023 14:37:11 +0800</pubDate><description><![CDATA[【代码】水陆距离(多源BFS)]]></description><category></category></item><item><title><![CDATA[01组成的N的倍数]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/134741641</link><guid>https://blog.youkuaiyun.com/beihais/article/details/134741641</guid><author>beihais</author><pubDate>Fri, 01 Dec 2023 18:47:56 +0800</pubDate><description><![CDATA[【代码】01组成的N的倍数。]]></description><category></category></item><item><title><![CDATA[野生动物园]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/134673776</link><guid>https://blog.youkuaiyun.com/beihais/article/details/134673776</guid><author>beihais</author><pubDate>Tue, 28 Nov 2023 18:19:21 +0800</pubDate><description><![CDATA[【代码】野生动物园。]]></description><category></category></item><item><title><![CDATA[最小树高 (树、二分)]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/134614306</link><guid>https://blog.youkuaiyun.com/beihais/article/details/134614306</guid><author>beihais</author><pubDate>Sat, 25 Nov 2023 14:33:22 +0800</pubDate><description><![CDATA[【代码】最小树高 (树、二分)]]></description><category></category></item><item><title><![CDATA[递增矩阵(思维题)]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/134614108</link><guid>https://blog.youkuaiyun.com/beihais/article/details/134614108</guid><author>beihais</author><pubDate>Sat, 25 Nov 2023 14:21:50 +0800</pubDate><description><![CDATA[【代码】递增矩阵(思维题)]]></description><category></category></item><item><title><![CDATA[九转数据结构]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/134604639</link><guid>https://blog.youkuaiyun.com/beihais/article/details/134604639</guid><author>beihais</author><pubDate>Fri, 24 Nov 2023 18:25:00 +0800</pubDate><description><![CDATA[【代码】九转数据结构。]]></description><category></category></item><item><title><![CDATA[贪心题目整理]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/134557938</link><guid>https://blog.youkuaiyun.com/beihais/article/details/134557938</guid><author>beihais</author><pubDate>Wed, 22 Nov 2023 17:16:27 +0800</pubDate><description><![CDATA[https://codeforces.com/contest/1593/problem/C    C. Save More Mice  （猫抓老鼠-----简单贪心。https://ac.nowcoder.com/acm/contest/11216/H   终别（杀怪兽）–前缀和 *** （1）https://ac.nowcoder.com/acm/contest/11223/E   对决 (思维分析 – 贪心 , 排序)然后枚举左端点不超过右端点+1的所有区间,选择右端点最靠右的一个即可。]]></description><category></category></item><item><title><![CDATA[轻重搭配 (贪心)]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/134557826</link><guid>https://blog.youkuaiyun.com/beihais/article/details/134557826</guid><author>beihais</author><pubDate>Wed, 22 Nov 2023 17:10:25 +0800</pubDate><description><![CDATA[【代码】轻重搭配 (贪心)]]></description><category></category></item><item><title><![CDATA[F. Vlad and Unfinished Business]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/134546204</link><guid>https://blog.youkuaiyun.com/beihais/article/details/134546204</guid><author>beihais</author><pubDate>Wed, 22 Nov 2023 09:42:21 +0800</pubDate><description><![CDATA[【代码】F. Vlad and Unfinished Business。]]></description><category></category></item><item><title><![CDATA[夜刀与黑角(树)]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/134516591</link><guid>https://blog.youkuaiyun.com/beihais/article/details/134516591</guid><author>beihais</author><pubDate>Mon, 20 Nov 2023 19:39:33 +0800</pubDate><description><![CDATA[【代码】夜刀与黑角(树)]]></description><category></category></item><item><title><![CDATA[九转数据结构]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/134511991</link><guid>https://blog.youkuaiyun.com/beihais/article/details/134511991</guid><author>beihais</author><pubDate>Mon, 20 Nov 2023 16:18:27 +0800</pubDate><description><![CDATA[【代码】九转数据结构。]]></description><category></category></item><item><title><![CDATA[兔兔煮鱼(数学问题)]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/134511719</link><guid>https://blog.youkuaiyun.com/beihais/article/details/134511719</guid><author>beihais</author><pubDate>Mon, 20 Nov 2023 16:10:28 +0800</pubDate><description><![CDATA[【代码】兔兔煮鱼(数学问题)]]></description><category></category></item><item><title><![CDATA[☀阳☀光☀开☀朗☀并☀查☀集☀]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/134383804</link><guid>https://blog.youkuaiyun.com/beihais/article/details/134383804</guid><author>beihais</author><pubDate>Mon, 13 Nov 2023 18:38:44 +0800</pubDate><description><![CDATA[【代码】【无标题】]]></description><category></category></item><item><title><![CDATA[行测成语积累]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/134341028</link><guid>https://blog.youkuaiyun.com/beihais/article/details/134341028</guid><author>beihais</author><pubDate>Fri, 10 Nov 2023 20:58:16 +0800</pubDate><description><![CDATA[度德量力: 衡量自己的德行是否能够服人
先声夺人：比喻做事抢先一步

]]></description><category></category></item><item><title><![CDATA[2022 RoboCom 世界机器人开发者大赛-高职组 国赛（RC-v3 智能护理中心统计）]]></title><link>https://blog.youkuaiyun.com/beihais/article/details/126249272</link><guid>https://blog.youkuaiyun.com/beihais/article/details/126249272</guid><author>beihais</author><pubDate>Tue, 09 Aug 2022 16:03:07 +0800</pubDate><description><![CDATA[两种操作：1. 转院. 2. 查询 该管理节点以下总的老人人数.题意：给出各管理节点的关系，和每个管理节点的照护老人数量。]]></description><category></category></item></channel></rss>