<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[MenghuanL的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/MenghuanL</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; MenghuanL]]></copyright><item><title><![CDATA[2025牛客寒假算法基础集训营1]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/145609654</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/145609654</guid><author>MenghuanL</author><pubDate>Thu, 13 Feb 2025 12:57:33 +0800</pubDate><description><![CDATA[总结：排名：566，过题数：6开题太慢了，被A卡了，中后期题没开，后面下机了（doge）]]></description><category></category></item><item><title><![CDATA[2025牛客寒假算法基础集训营2]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/145530881</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/145530881</guid><author>MenghuanL</author><pubDate>Sun, 09 Feb 2025 12:55:50 +0800</pubDate><description><![CDATA[总结：排名：113 10题 803罚时。]]></description><category></category></item><item><title><![CDATA[牛客周赛 Round 77]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/145268865</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/145268865</guid><author>MenghuanL</author><pubDate>Mon, 20 Jan 2025 20:25:29 +0800</pubDate><description><![CDATA[Solution：手模发现，前面一定是每个数字都出现，且次数相同，最后后面再放一些数字只出现一次。故只要判断数字的最少次数和最多次数差距不大于1即可。Solution：考虑以u为目标lca的答案，num[i]记录以i为根的子树包含的目标节点的个数。Solution：按位进行运算，将这一位为1的账号使用并查集进行合并。，问能否经过排列，使其每个长度为9的连续子数组都包含。Description：给定n个数，每个数的范围为。Solution：上下和左右是独立的，根据裴蜀定理。tag：并查集 + 位运算。]]></description><category></category></item><item><title><![CDATA[Codeforces Round 998 (Div. 3）]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/145268191</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/145268191</guid><author>MenghuanL</author><pubDate>Mon, 20 Jan 2025 19:31:48 +0800</pubDate><description><![CDATA[总结：复建，Cwa两发，E读假题了。]]></description><category></category></item><item><title><![CDATA[Educational Codeforces Round 172 (Rated for Div. 2)（C-D)]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/144775319</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/144775319</guid><author>MenghuanL</author><pubDate>Fri, 27 Dec 2024 18:24:03 +0800</pubDate><description><![CDATA[个数前面划分一次的贡献为其后缀和，因此我们贪心的取后缀和即可，注意第一个数前面不能划分。用两个数组R[i]，L[i]，存储第i个区间对应的右边界和左边界。Description：给定n个区间[l,r]，输入所有。Description：有一个序列含。的最小区间划分数，如果不能输出。个区间，从前往后每个区间中第。，但是前者返回的是迭代器。tag：后缀和 + 思维。，求序列权值和大于等于。Solution：在第。]]></description><category></category></item><item><title><![CDATA[Educational Codeforces Round 173 (Rated for Div. 2)]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/144754685</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/144754685</guid><author>MenghuanL</author><pubDate>Thu, 26 Dec 2024 22:43:47 +0800</pubDate><description><![CDATA[总结：翻译插件用不了了，B题题意一直没看懂，C题出思路了好久才写出来，评价为太久没打了。]]></description><category></category></item><item><title><![CDATA[Codeforces Round 968 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/141611712</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/141611712</guid><author>MenghuanL</author><pubDate>Tue, 27 Aug 2024 20:26:46 +0800</pubDate><description><![CDATA[总结：C题想到了，但是写成shi了，出得有点慢。]]></description><category></category></item><item><title><![CDATA[Codeforces Round 967 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/141608365</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/141608365</guid><author>MenghuanL</author><pubDate>Tue, 27 Aug 2024 17:27:31 +0800</pubDate><description><![CDATA[总结：B题没测试就交wa一发，C题一直没想到怎么回溯，哎。]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 367]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/141322466</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/141322466</guid><author>MenghuanL</author><pubDate>Mon, 19 Aug 2024 12:36:56 +0800</pubDate><description><![CDATA[总结：发挥很一般，A一直wa。开场有点事，导致D也没debug出来。]]></description><category></category></item><item><title><![CDATA[Educational Codeforces Round 168 (Rated for Div. 2)]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/140908099</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/140908099</guid><author>MenghuanL</author><pubDate>Sun, 04 Aug 2024 16:50:18 +0800</pubDate><description><![CDATA[总结：题目较简单，但是发挥很一般。A，B题一直读假题，卡了半个小时；C题用char存int，难绷了。]]></description><category></category></item><item><title><![CDATA[Pinely Round 4 (Div. 1 + Div. 2)]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/140899840</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/140899840</guid><author>MenghuanL</author><pubDate>Sun, 04 Aug 2024 01:33:07 +0800</pubDate><description><![CDATA[总结：被B卡了一年。]]></description><category></category></item><item><title><![CDATA[Codeforces Round 962 (Div. 3)]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/140751763</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/140751763</guid><author>MenghuanL</author><pubDate>Sun, 28 Jul 2024 15:51:28 +0800</pubDate><description><![CDATA[总结：ABC秒过，D有点难评了，E优化很妙。]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 362]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/140741417</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/140741417</guid><author>MenghuanL</author><pubDate>Sat, 27 Jul 2024 21:18:09 +0800</pubDate><description><![CDATA[Description：给定一个图，每个点，边都有权值，求所有从起点。Competing：想到了如何判断是否有解，但是没想到贪心求解。Solution：Dijkstra板子，将权值加上点的权值即可。状态表示：显然需要有长度和公差，然后需要一个位置。注意到公差的范围很大，我们使用。的路径长度（边的权值 + 点的权值）。Solution：先判断是否有解，令。Description：给定一个数组。，求不同长度的等差数列的个数（Description：给定。的长度很小，所有我们可以考虑。的所有等差数列的集合。]]></description><category></category></item><item><title><![CDATA[Codeforces Round 961 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/140662250</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/140662250</guid><author>MenghuanL</author><pubDate>Wed, 24 Jul 2024 14:26:35 +0800</pubDate><description><![CDATA[总结：B1wa两发可惜，C出得有点小慢。]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 363]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/140622739</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/140622739</guid><author>MenghuanL</author><pubDate>Tue, 23 Jul 2024 00:48:12 +0800</pubDate><description><![CDATA[总结：前三题过于easy了，C的暴力写挂了一发。D差一点？，差一点总结；]]></description><category></category></item><item><title><![CDATA[Codeforces Round 960 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/140609471</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/140609471</guid><author>MenghuanL</author><pubDate>Mon, 22 Jul 2024 14:40:37 +0800</pubDate><description><![CDATA[总结：Awa 2，Bwa 2，C一直wa。很难评价的一场。感觉D < C。]]></description><category></category></item><item><title><![CDATA[Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2)]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/140562691</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/140562691</guid><author>MenghuanL</author><pubDate>Sat, 20 Jul 2024 01:22:29 +0800</pubDate><description><![CDATA[总结：Bwa两发，C读假题。发挥很一般。]]></description><category></category></item><item><title><![CDATA[Codeforces Round 958 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/140491667</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/140491667</guid><author>MenghuanL</author><pubDate>Wed, 17 Jul 2024 12:34:12 +0800</pubDate><description><![CDATA[总结：C因为常数没转longlongwa两发，难绷。]]></description><category></category></item><item><title><![CDATA[Codeforces Round 957 (Div. 3)]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/140390117</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/140390117</guid><author>MenghuanL</author><pubDate>Fri, 12 Jul 2024 22:44:37 +0800</pubDate><description><![CDATA[Codeforces Round 957 (Div. 3)]]></description><category></category></item><item><title><![CDATA[高精度加法、乘法详解]]></title><link>https://blog.youkuaiyun.com/MenghuanL/article/details/132769626</link><guid>https://blog.youkuaiyun.com/MenghuanL/article/details/132769626</guid><author>MenghuanL</author><pubDate>Sat, 09 Sep 2023 00:38:29 +0800</pubDate><description><![CDATA[高精度加法与乘法详解]]></description><category></category></item></channel></rss>