<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[andycode_的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/andycode_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; andycode_]]></copyright><item><title><![CDATA[题解：P11747 「TPOI-1A」鞋子特大号]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/145726086</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/145726086</guid><author>andycode_</author><pubDate>Wed, 19 Feb 2025 12:01:07 +0800</pubDate><description><![CDATA[数学题]]></description><category></category></item><item><title><![CDATA[题解：P11725 [JOIG 2025] 修学旅行 / School Trip]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/145642846</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/145642846</guid><author>andycode_</author><pubDate>Fri, 14 Feb 2025 22:34:00 +0800</pubDate><description><![CDATA[构造形如满三叉树的线段树]]></description><category></category></item><item><title><![CDATA[题解：P10972 I-Country]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/145381494</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/145381494</guid><author>andycode_</author><pubDate>Mon, 27 Jan 2025 18:27:15 +0800</pubDate><description><![CDATA[细节很多一道dp题]]></description><category></category></item><item><title><![CDATA[题解：P11448 「ALFR Round 3」D 核裂变]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/144713698</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/144713698</guid><author>andycode_</author><pubDate>Wed, 25 Dec 2024 11:04:07 +0800</pubDate><description><![CDATA[bfs统计贡献]]></description><category></category></item><item><title><![CDATA[题解：AT_abc100_d [ABC100D] Patisserie ABC]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/144692003</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/144692003</guid><author>andycode_</author><pubDate>Tue, 24 Dec 2024 13:11:56 +0800</pubDate><description><![CDATA[动态规划]]></description><category></category></item><item><title><![CDATA[题解：P11378 [GESP202412 七级] 燃烧]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/144433202</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/144433202</guid><author>andycode_</author><pubDate>Thu, 12 Dec 2024 18:24:03 +0800</pubDate><description><![CDATA[dfs+动态规划]]></description><category></category></item><item><title><![CDATA[题解：P11380 [GESP202412 八级] 排队]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/144423211</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/144423211</guid><author>andycode_</author><pubDate>Thu, 12 Dec 2024 12:57:01 +0800</pubDate><description><![CDATA[八级的真题变水了……]]></description><category></category></item><item><title><![CDATA[题解：P11251 [GESP202409 八级] 美丽路径]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/143752915</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/143752915</guid><author>andycode_</author><pubDate>Wed, 13 Nov 2024 21:26:02 +0800</pubDate><description><![CDATA[求一条路径，使得路径上距离为奇数的点颜色不同，距离为偶数的点颜色相同，输出这条路径最多能包含多少结点。，将两条以它的颜色不同于它的子节点为起点的路径相连。从大到小进行排序，或放进一个大根堆中，取最大的两个相加再加。为起点或终点的美丽路径最多包含多少个结点。为起点或终点的美丽路径，其实就是用结点。的所有子结点，设当前搜索到的子节点为。为起点的美丽路径最多包含多少个结点，为根节点的子树中，经过结点。的所有颜色不同于它的子节点。为根节点的子树中，不以。为根节点的子树中，以。为起点的美丽路径上，]]></description><category></category></item><item><title><![CDATA[题解：P11250 [GESP202409 八级] 手套配对]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/143677763</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/143677763</guid><author>andycode_</author><pubDate>Mon, 11 Nov 2024 11:58:58 +0800</pubDate><description><![CDATA[一道非常经典的关于排列组合的题目]]></description><category></category></item><item><title><![CDATA[题解：P11248 [GESP202409 七级] 矩阵移动]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/143591424</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/143591424</guid><author>andycode_</author><pubDate>Thu, 07 Nov 2024 12:58:15 +0800</pubDate><description><![CDATA[开始，每次只能向右或向下移动，走到。的矩阵，你可以选择至多。很容易想到动态规划。]]></description><category></category></item><item><title><![CDATA[题解：P11215 【MX-J8-T3】水星湖]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/143147880</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/143147880</guid><author>andycode_</author><pubDate>Tue, 22 Oct 2024 12:07:49 +0800</pubDate><description><![CDATA[bfs水题]]></description><category></category></item><item><title><![CDATA[题解：P2789 直线交点数]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/143109353</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/143109353</guid><author>andycode_</author><pubDate>Mon, 21 Oct 2024 13:23:36 +0800</pubDate><description><![CDATA[dfs水题]]></description><category></category></item><item><title><![CDATA[题解：P11046 [蓝桥杯 2024 省 Java B] 星际旅行]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/142529539</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/142529539</guid><author>andycode_</author><pubDate>Wed, 25 Sep 2024 17:50:05 +0800</pubDate><description><![CDATA[简单BFS题目]]></description><category></category></item><item><title><![CDATA[题解：P11004 [蓝桥杯 2024 省 Python B] 魔法巡游]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/142255187</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/142255187</guid><author>andycode_</author><pubDate>Sat, 14 Sep 2024 12:13:03 +0800</pubDate><description><![CDATA[虽然是 python 题，但我还是用 C++ 做了。]]></description><category></category></item><item><title><![CDATA[题解：P11029 『DABOI Round 1』A Simple Problem]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/142136771</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/142136771</guid><author>andycode_</author><pubDate>Wed, 11 Sep 2024 12:42:11 +0800</pubDate><description><![CDATA[那时间复杂度为遍历的时长乘上快速幂的时长，即。仔细观察，不难发现。，用等差数列公式求和，为。不知道快速幂的请移步。]]></description><category></category></item><item><title><![CDATA[二进制的原码、反码和补码。]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/141900201</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/141900201</guid><author>andycode_</author><pubDate>Thu, 05 Sep 2024 20:30:51 +0800</pubDate><description><![CDATA[众所周知，电脑使用二进制来储存数据。为了能存储负数，电脑会将最高的二进制位设为符号位，当符号位为0时，该数为非负整数，当符号位为1时，该数为负数。所以像int和long long这种整型变量就能存储负数，而无符号类型变量等，由于没有符号位，不能存储负数，但能存储的值比有符号类型变量的更大。虽然能存储负数了，但使用这种存储方式将负数与其他数进行运算时，会很麻烦。为了让负数方便地与其他数进行运算，补码就诞生了。]]></description><category></category></item><item><title><![CDATA[树状数组详解]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/141671720</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/141671720</guid><author>andycode_</author><pubDate>Mon, 02 Sep 2024 20:11:59 +0800</pubDate><description><![CDATA[树状数组或二叉索引树（英语：Binary Indexed Tree），又以其发明者命名为Fenwick树，最早由Peter M. Fenwick于1994年以A New Data Structure for Cumulative Frequency Tables为题发表在SOFTWARE PRACTICE AND EXPERIENCE。其初衷是解决数据压缩里的累积频率（Cumulative Frequency）的计算问题（当我没说），现多用于高效计算数列的前缀和， 区间和。以上内容来自网络。]]></description><category></category></item><item><title><![CDATA[题解：P11001 [蓝桥杯 2024 省 Python B] 连连看]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/141785664</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/141785664</guid><author>andycode_</author><pubDate>Sun, 01 Sep 2024 16:07:12 +0800</pubDate><description><![CDATA[虽然这是一道Python题，但我还是忍不住写了一个C++题解。]]></description><category></category></item><item><title><![CDATA[前缀和解析+B3612【深进1.例1】求区间和 题解]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/141648041</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/141648041</guid><author>andycode_</author><pubDate>Wed, 28 Aug 2024 19:58:06 +0800</pubDate><description><![CDATA[前缀和为一个数组前几个数的和。比如，定义一个a数组，和一个前缀和数组s。那么si​∑j1i​aj​，即a数组前i个数的和。同时，我们还可以得出si​的递推公式si​si−1​ai​s0​0。举个例子，设a数组的元素为114514，那s数组的元素为126111216。]]></description><category></category></item><item><title><![CDATA[洛谷 P10835 『FLA - I』冲云霄 题解]]></title><link>https://blog.youkuaiyun.com/andycode_/article/details/141647329</link><guid>https://blog.youkuaiyun.com/andycode_/article/details/141647329</guid><author>andycode_</author><pubDate>Wed, 28 Aug 2024 18:38:20 +0800</pubDate><description><![CDATA[中的元素都相同，所以根据前面的公式，两两异或后的结果为。中的元素都为正整数，所以根据上面得出的公式(的元素是多少，只要是正整数，结果一定会是。为奇数时，才存在满足条件的序列，因为当。与上面同理，将序列中的元素两两异或为。根据这两条公式，可得出以下结论。为偶数时，才存在满足条件的序列。为偶数时，根据上面得出的公式，的所有项异或得到的结果等于。根据上面得出的结论，分类讨论。的结果肯定也为一个正整数。，判断是否存在一个长度为。中所有元素的值都相同。以外的元素两两异或为。]]></description><category></category></item></channel></rss>