<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[hellomide的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/hellomide</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hellomide]]></copyright><item><title><![CDATA[个人CSP-J复赛题解 - 1]]></title><link>https://blog.youkuaiyun.com/hellomide/article/details/152414186</link><guid>https://blog.youkuaiyun.com/hellomide/article/details/152414186</guid><author>hellomide</author><pubDate>Thu, 02 Oct 2025 20:54:49 +0800</pubDate><description><![CDATA[一道较为新颖题目的题解，内容十分易懂，题目也非常简单，推荐CSP-J复赛初学者查看该题解]]></description><category></category></item><item><title><![CDATA[洛谷P3367【模版】并查集 C++题解]]></title><link>https://blog.youkuaiyun.com/hellomide/article/details/149235280</link><guid>https://blog.youkuaiyun.com/hellomide/article/details/149235280</guid><author>hellomide</author><pubDate>Thu, 10 Jul 2025 20:13:59 +0800</pubDate><description><![CDATA[本文介绍了并查集的基本概念和操作方法。并查集是一种支持合并和查询的数据结构，常用于处理集合关系。文章通过熟人关系的例子，解释了初始化、查询领导(使用路径压缩优化)和合并集合(使用秩优化)三个核心操作，并给出了洛谷P3367题的完整代码实现。最后还提供了优化思路，帮助读者理解如何提高并查集的效率。]]></description><category></category></item><item><title><![CDATA[【首发】 CSP-J 2024 真题]]></title><link>https://blog.youkuaiyun.com/hellomide/article/details/142424158</link><guid>https://blog.youkuaiyun.com/hellomide/article/details/142424158</guid><author>hellomide</author><pubDate>Sat, 21 Sep 2024 21:30:29 +0800</pubDate><description><![CDATA[3 某公司有 10 名员工，分为 3 个部门：A 部门有 4 名员工，B 部门有 3 名员工、C 部门有 3 名员工。给定三根柱子，分别标记为 A、B 和 C。12 已知二叉树的前序遍历为[A,B,D,E,C,F,G],中序遍历为[D,B,E,A,F,C,G],求二叉树的后序遍历 的结果是（ ）5 记 1Kb 位 1024 字节（byte），1MB 位 1024KB，那么 1MB 是多少二进制位（bit）（ ）27 当输入为“2 3”时，customFunction（2,3）的返回值为“64”（ ）]]></description><category></category></item><item><title><![CDATA[【C++基础算法】 洛谷P1454 圣诞夜的极光]]></title><link>https://blog.youkuaiyun.com/hellomide/article/details/137011331</link><guid>https://blog.youkuaiyun.com/hellomide/article/details/137011331</guid><author>hellomide</author><pubDate>Mon, 25 Mar 2024 13:43:07 +0800</pubDate><description><![CDATA[一道搜索的题目]]></description><category></category></item><item><title><![CDATA[MarkDown教程(1)]]></title><link>https://blog.youkuaiyun.com/hellomide/article/details/135901334</link><guid>https://blog.youkuaiyun.com/hellomide/article/details/135901334</guid><author>hellomide</author><pubDate>Sun, 28 Jan 2024 22:04:46 +0800</pubDate><description><![CDATA[刷题网站中有很多人出题，出题就需要用到MD或者KaTeX。那让我们一起来学习MD吧!]]></description><category></category></item><item><title><![CDATA[Python tkinter(1)]]></title><link>https://blog.youkuaiyun.com/hellomide/article/details/132256864</link><guid>https://blog.youkuaiyun.com/hellomide/article/details/132256864</guid><author>hellomide</author><pubDate>Thu, 25 Jan 2024 10:59:38 +0800</pubDate><description><![CDATA[这篇文章主要讲述Python tkinter编程,虽然说做软件不可能,但至少可以应付一下日常生活]]></description><category></category></item><item><title><![CDATA[洛谷背包题:P1616 疯狂的采药]]></title><link>https://blog.youkuaiyun.com/hellomide/article/details/135836457</link><guid>https://blog.youkuaiyun.com/hellomide/article/details/135836457</guid><author>hellomide</author><pubDate>Thu, 25 Jan 2024 10:16:24 +0800</pubDate><description><![CDATA[背包其实九分甚至十分简单，像我这种小蒟蒻都可以做，只要举一反三就可以啦~]]></description><category></category></item><item><title><![CDATA[做一个编程语言(1)]]></title><link>https://blog.youkuaiyun.com/hellomide/article/details/132391944</link><guid>https://blog.youkuaiyun.com/hellomide/article/details/132391944</guid><author>hellomide</author><pubDate>Sun, 20 Aug 2023 19:26:16 +0800</pubDate><description><![CDATA[做一个编程语言,叫做KSS,版本Alpha 0.1.]]></description><category></category></item><item><title><![CDATA[测试(飞机大战)(C++)]]></title><link>https://blog.youkuaiyun.com/hellomide/article/details/131753756</link><guid>https://blog.youkuaiyun.com/hellomide/article/details/131753756</guid><author>hellomide</author><pubDate>Sun, 16 Jul 2023 19:08:19 +0800</pubDate><description><![CDATA[cout<<"简单敌人有着较慢的移动速度，比较容易对付";cout<<"error code 01：无法填充行，因为两个坐标的纵坐标(x)不相等";cout<<"error code 02：无法填充列，因为两个坐标的横坐标(y)不相等";cout<<"简单的敌人：";cout<<"冷酷的敌人：";cout<<"击落敌机："<<score/5<<" 架";title="Lv.10 极限王牌";title="Lv.7 超级王牌";title="Lv.8 巅峰王牌";title="Lv.9 终极王牌";]]></description><category></category></item></channel></rss>