<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <title>HugeYlh</title>
  
  <subtitle>奔赴山海，保持热爱</subtitle>
  <link href="https://luumod.github.io/atom.xml" rel="self"/>
  
  <link href="https://luumod.github.io/"/>
  <updated>2023-04-09T09:19:10.744Z</updated>
  <id>https://luumod.github.io/</id>
  
  <author>
    <name>ylh</name>
    
  </author>
  
  <generator uri="https://hexo.io/">Hexo</generator>
  
  <entry>
    <title>windows编程（2）- 消息与循环</title>
    <link href="https://luumod.github.io/2023/04/09/windows%E7%BC%96%E7%A8%8B%EF%BC%882%EF%BC%89-%E6%B6%88%E6%81%AF%E4%B8%8E%E5%BE%AA%E7%8E%AF/"/>
    <id>https://luumod.github.io/2023/04/09/windows%E7%BC%96%E7%A8%8B%EF%BC%882%EF%BC%89-%E6%B6%88%E6%81%AF%E4%B8%8E%E5%BE%AA%E7%8E%AF/</id>
    <published>2023-04-09T08:30:08.000Z</published>
    <updated>2023-04-09T09:19:10.744Z</updated>
    
    
    <summary type="html">windows消息循环与常见的消息类型，包括窗口，鼠标，键盘，外部设备等基本消息。</summary>
    
    
    
    <category term="编程学习" scheme="https://luumod.github.io/categories/%E7%BC%96%E7%A8%8B%E5%AD%A6%E4%B9%A0/"/>
    
    
    <category term="windows编程" scheme="https://luumod.github.io/tags/windows%E7%BC%96%E7%A8%8B/"/>
    
  </entry>
  
  <entry>
    <title>数论及模板</title>
    <link href="https://luumod.github.io/2023/04/04/%E6%95%B0%E8%AE%BA%E5%8F%8A%E6%A8%A1%E6%9D%BF/"/>
    <id>https://luumod.github.io/2023/04/04/%E6%95%B0%E8%AE%BA%E5%8F%8A%E6%A8%A1%E6%9D%BF/</id>
    <published>2023-04-04T09:36:55.000Z</published>
    <updated>2023-04-05T05:49:33.229Z</updated>
    
    
    <summary type="html">算法复习：常见数论题目及数论模板代码</summary>
    
    
    
    <category term="算法题解" scheme="https://luumod.github.io/categories/%E7%AE%97%E6%B3%95%E9%A2%98%E8%A7%A3/"/>
    
    
    <category term="数论" scheme="https://luumod.github.io/tags/%E6%95%B0%E8%AE%BA/"/>
    
  </entry>
  
  <entry>
    <title>数据对拍器</title>
    <link href="https://luumod.github.io/2023/04/04/%E6%95%B0%E6%8D%AE%E5%AF%B9%E6%8B%8D%E5%99%A8/"/>
    <id>https://luumod.github.io/2023/04/04/%E6%95%B0%E6%8D%AE%E5%AF%B9%E6%8B%8D%E5%99%A8/</id>
    <published>2023-04-04T06:01:32.000Z</published>
    <updated>2023-04-04T09:38:50.534Z</updated>
    
    
    <summary type="html">通过手写两种解法（优化 and 暴力）并且通过数据对拍的功能来实现降低我们程序出错的可能性，数据对拍在蓝桥杯等竞赛中是一个不错的技巧。</summary>
    
    
    
    <category term="实用技术" scheme="https://luumod.github.io/categories/%E5%AE%9E%E7%94%A8%E6%8A%80%E6%9C%AF/"/>
    
    
    <category term="编程技巧" scheme="https://luumod.github.io/tags/%E7%BC%96%E7%A8%8B%E6%8A%80%E5%B7%A7/"/>
    
  </entry>
  
  <entry>
    <title>最小生成树详解+模板</title>
    <link href="https://luumod.github.io/2023/04/02/%E6%9C%80%E5%B0%8F%E7%94%9F%E6%88%90%E6%A0%91%E8%AF%A6%E8%A7%A3-%E6%A8%A1%E6%9D%BF/"/>
    <id>https://luumod.github.io/2023/04/02/%E6%9C%80%E5%B0%8F%E7%94%9F%E6%88%90%E6%A0%91%E8%AF%A6%E8%A7%A3-%E6%A8%A1%E6%9D%BF/</id>
    <published>2023-04-02T12:32:47.000Z</published>
    <updated>2023-04-03T08:43:28.941Z</updated>
    
    
    <summary type="html">图论：最小生成树详解，Prim算法+Kruskal算法 模板代码。最小生成树是图论中的一个重要概念，它可以用来解决许多实际问题，例如网络设计、电路设计、城市规划等。本文将详细介绍最小生成树的概念、算法和应用。</summary>
    
    
    
    <category term="算法题解" scheme="https://luumod.github.io/categories/%E7%AE%97%E6%B3%95%E9%A2%98%E8%A7%A3/"/>
    
    
    <category term="最小生成树" scheme="https://luumod.github.io/tags/%E6%9C%80%E5%B0%8F%E7%94%9F%E6%88%90%E6%A0%91/"/>
    
  </entry>
  
  <entry>
    <title>Hexo+Next博客配置字体</title>
    <link href="https://luumod.github.io/2023/04/01/Hexo-Next%E5%8D%9A%E5%AE%A2%E9%85%8D%E7%BD%AE%E5%AD%97%E4%BD%93/"/>
    <id>https://luumod.github.io/2023/04/01/Hexo-Next%E5%8D%9A%E5%AE%A2%E9%85%8D%E7%BD%AE%E5%AD%97%E4%BD%93/</id>
    <published>2023-04-01T15:39:45.000Z</published>
    <updated>2023-04-01T16:04:35.576Z</updated>
    
    
    <summary type="html">hexo博客优化，字体样式的配置</summary>
    
    
    
    <category term="实用技术" scheme="https://luumod.github.io/categories/%E5%AE%9E%E7%94%A8%E6%8A%80%E6%9C%AF/"/>
    
    
    <category term="hexo博客配置" scheme="https://luumod.github.io/tags/hexo%E5%8D%9A%E5%AE%A2%E9%85%8D%E7%BD%AE/"/>
    
  </entry>
  
  <entry>
    <title>Hexo+Next博客背景图片+界面优化</title>
    <link href="https://luumod.github.io/2023/04/01/Hexo-Next%E5%8D%9A%E5%AE%A2%E8%AE%BE%E7%BD%AE%E8%83%8C%E6%99%AF%E5%9B%BE%E7%89%87-%E7%95%8C%E9%9D%A2%E4%BC%98%E5%8C%96/"/>
    <id>https://luumod.github.io/2023/04/01/Hexo-Next%E5%8D%9A%E5%AE%A2%E8%AE%BE%E7%BD%AE%E8%83%8C%E6%99%AF%E5%9B%BE%E7%89%87-%E7%95%8C%E9%9D%A2%E4%BC%98%E5%8C%96/</id>
    <published>2023-04-01T15:14:35.000Z</published>
    <updated>2023-04-04T14:32:05.941Z</updated>
    
    
    <summary type="html">博客优化记录：背景与页面的优化，添加背景图片，设置背景透明度，边框圆角，页面宽度的设置，添加live2D模型，文字的样式等等配置</summary>
    
    
    
    <category term="实用技术" scheme="https://luumod.github.io/categories/%E5%AE%9E%E7%94%A8%E6%8A%80%E6%9C%AF/"/>
    
    
    <category term="hexo博客配置" scheme="https://luumod.github.io/tags/hexo%E5%8D%9A%E5%AE%A2%E9%85%8D%E7%BD%AE/"/>
    
  </entry>
  
  <entry>
    <title>图的最短路问题（spfa+Dijkstra+floyd 模板代码c++）</title>
    <link href="https://luumod.github.io/2023/04/01/%E5%9B%BE%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E9%97%AE%E9%A2%98%EF%BC%88spfa-Dijkstra-floyd-%E6%A8%A1%E6%9D%BF%E4%BB%A3%E7%A0%81c-%EF%BC%89/"/>
    <id>https://luumod.github.io/2023/04/01/%E5%9B%BE%E7%9A%84%E6%9C%80%E7%9F%AD%E8%B7%AF%E9%97%AE%E9%A2%98%EF%BC%88spfa-Dijkstra-floyd-%E6%A8%A1%E6%9D%BF%E4%BB%A3%E7%A0%81c-%EF%BC%89/</id>
    <published>2023-04-01T12:51:26.000Z</published>
    <updated>2023-04-01T14:22:01.663Z</updated>
    
    
    <summary type="html">图论：图的最短路径问题，三种最短路 spfa+Dijkstra+floyd算法例题：反向建边；最短路计数；最短距离；作物杂交；铁路与公路。</summary>
    
    
    
    <category term="算法世界" scheme="https://luumod.github.io/categories/%E7%AE%97%E6%B3%95%E4%B8%96%E7%95%8C/"/>
    
    
    <category term="最短路问题" scheme="https://luumod.github.io/tags/%E6%9C%80%E7%9F%AD%E8%B7%AF%E9%97%AE%E9%A2%98/"/>
    
  </entry>
  
  <entry>
    <title>bfs与dfs详解（例题+模板c++代码）</title>
    <link href="https://luumod.github.io/2023/04/01/bfs%E4%B8%8Edfs%E8%AF%A6%E8%A7%A3%EF%BC%88%E4%BE%8B%E9%A2%98-%E6%A8%A1%E6%9D%BFc-%E4%BB%A3%E7%A0%81%EF%BC%89/"/>
    <id>https://luumod.github.io/2023/04/01/bfs%E4%B8%8Edfs%E8%AF%A6%E8%A7%A3%EF%BC%88%E4%BE%8B%E9%A2%98-%E6%A8%A1%E6%9D%BFc-%E4%BB%A3%E7%A0%81%EF%BC%89/</id>
    <published>2023-04-01T10:14:04.000Z</published>
    <updated>2023-04-01T15:37:15.640Z</updated>
    
    
    <summary type="html">蓝桥杯算法复习：bfs与dfs详解，附带例题+模板代码，DFS（深度优先搜索）和BFS（广度优先搜索）是图论中两个重要的算法。</summary>
    
    
    
    <category term="算法世界" scheme="https://luumod.github.io/categories/%E7%AE%97%E6%B3%95%E4%B8%96%E7%95%8C/"/>
    
    
    <category term="bfs与dfs" scheme="https://luumod.github.io/tags/bfs%E4%B8%8Edfs/"/>
    
  </entry>
  
  <entry>
    <title>windows编程（1）-第一个窗口程序</title>
    <link href="https://luumod.github.io/2023/03/30/windows%E7%BC%96%E7%A8%8B%EF%BC%881%EF%BC%89-%E7%AC%AC%E4%B8%80%E4%B8%AA%E7%AA%97%E5%8F%A3%E7%A8%8B%E5%BA%8F/"/>
    <id>https://luumod.github.io/2023/03/30/windows%E7%BC%96%E7%A8%8B%EF%BC%881%EF%BC%89-%E7%AC%AC%E4%B8%80%E4%B8%AA%E7%AA%97%E5%8F%A3%E7%A8%8B%E5%BA%8F/</id>
    <published>2023-03-30T06:44:41.000Z</published>
    <updated>2023-03-30T07:55:56.650Z</updated>
    
    
    <summary type="html">windows编程学习 - 第一个窗口程序的创建，注册 创建 显示 刷新 消息循环 消息处理 完整代码</summary>
    
    
    
    <category term="编程学习" scheme="https://luumod.github.io/categories/%E7%BC%96%E7%A8%8B%E5%AD%A6%E4%B9%A0/"/>
    
    
    <category term="windows编程" scheme="https://luumod.github.io/tags/windows%E7%BC%96%E7%A8%8B/"/>
    
  </entry>
  
  <entry>
    <title>Trie字典树（例题详解+模板cpp）</title>
    <link href="https://luumod.github.io/2023/03/27/Trie%E5%AD%97%E5%85%B8%E6%A0%91/"/>
    <id>https://luumod.github.io/2023/03/27/Trie%E5%AD%97%E5%85%B8%E6%A0%91/</id>
    <published>2023-03-27T14:17:00.000Z</published>
    <updated>2023-03-27T15:56:36.904Z</updated>
    
    
    <summary type="html">蓝桥杯算法复习：Trie字典树详解+例题模板c++</summary>
    
    
    
    <category term="算法题解" scheme="https://luumod.github.io/categories/%E7%AE%97%E6%B3%95%E9%A2%98%E8%A7%A3/"/>
    
    
    <category term="Trie树" scheme="https://luumod.github.io/tags/Trie%E6%A0%91/"/>
    
  </entry>
  
  <entry>
    <title>单调队列（例题详解+模板cpp）</title>
    <link href="https://luumod.github.io/2023/03/27/%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97/"/>
    <id>https://luumod.github.io/2023/03/27/%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97/</id>
    <published>2023-03-27T06:09:07.000Z</published>
    <updated>2023-03-27T15:56:36.902Z</updated>
    
    
    <summary type="html">蓝桥杯算法复习：单调队列基本知识与例题讲解+模板c++</summary>
    
    
    
    <category term="算法题解" scheme="https://luumod.github.io/categories/%E7%AE%97%E6%B3%95%E9%A2%98%E8%A7%A3/"/>
    
    
    <category term="单调队列" scheme="https://luumod.github.io/tags/%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97/"/>
    
  </entry>
  
  <entry>
    <title>递推算法</title>
    <link href="https://luumod.github.io/2023/03/25/%E9%80%92%E6%8E%A8%E7%AE%97%E6%B3%95/"/>
    <id>https://luumod.github.io/2023/03/25/%E9%80%92%E6%8E%A8%E7%AE%97%E6%B3%95/</id>
    <published>2023-03-25T14:36:14.000Z</published>
    <updated>2023-03-25T15:53:16.437Z</updated>
    
    
    <summary type="html">蓝桥杯算法复习：递推算法 例题讲解+模板c++</summary>
    
    
    
    <category term="算法题解" scheme="https://luumod.github.io/categories/%E7%AE%97%E6%B3%95%E9%A2%98%E8%A7%A3/"/>
    
    
    <category term="递推与递归" scheme="https://luumod.github.io/tags/%E9%80%92%E6%8E%A8%E4%B8%8E%E9%80%92%E5%BD%92/"/>
    
  </entry>
  
  <entry>
    <title>二分查找例题与模板</title>
    <link href="https://luumod.github.io/2023/03/25/%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E4%BE%8B%E9%A2%98%E4%B8%8E%E6%A8%A1%E6%9D%BF/"/>
    <id>https://luumod.github.io/2023/03/25/%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE%E4%BE%8B%E9%A2%98%E4%B8%8E%E6%A8%A1%E6%9D%BF/</id>
    <published>2023-03-25T09:51:29.000Z</published>
    <updated>2023-03-25T14:21:20.400Z</updated>
    
    
    <summary type="html">蓝桥杯算法复习：二分查找专题，模板与例题讲解</summary>
    
    
    
    <category term="算法题解" scheme="https://luumod.github.io/categories/%E7%AE%97%E6%B3%95%E9%A2%98%E8%A7%A3/"/>
    
    
    <category term="二分算法" scheme="https://luumod.github.io/tags/%E4%BA%8C%E5%88%86%E7%AE%97%E6%B3%95/"/>
    
  </entry>
  
  <entry>
    <title>差分算法</title>
    <link href="https://luumod.github.io/2023/03/23/%E5%B7%AE%E5%88%86%E7%AE%97%E6%B3%95/"/>
    <id>https://luumod.github.io/2023/03/23/%E5%B7%AE%E5%88%86%E7%AE%97%E6%B3%95/</id>
    <published>2023-03-23T14:39:45.000Z</published>
    <updated>2023-03-23T16:11:08.960Z</updated>
    
    
    <summary type="html">蓝桥杯算法复习：数组的差分，差分算法例题与讲解。</summary>
    
    
    
    <category term="算法题解" scheme="https://luumod.github.io/categories/%E7%AE%97%E6%B3%95%E9%A2%98%E8%A7%A3/"/>
    
    
    <category term="差分" scheme="https://luumod.github.io/tags/%E5%B7%AE%E5%88%86/"/>
    
  </entry>
  
  <entry>
    <title>一维与二维前缀和</title>
    <link href="https://luumod.github.io/2023/03/23/%E4%B8%80%E7%BB%B4%E4%B8%8E%E4%BA%8C%E7%BB%B4%E5%89%8D%E7%BC%80%E5%92%8C/"/>
    <id>https://luumod.github.io/2023/03/23/%E4%B8%80%E7%BB%B4%E4%B8%8E%E4%BA%8C%E7%BB%B4%E5%89%8D%E7%BC%80%E5%92%8C/</id>
    <published>2023-03-23T13:59:16.000Z</published>
    <updated>2023-03-23T16:12:44.988Z</updated>
    
    
    <summary type="html">蓝桥杯复习知识点一：一维与二维前的公式及模板代码和例题</summary>
    
    
    
    <category term="算法题解" scheme="https://luumod.github.io/categories/%E7%AE%97%E6%B3%95%E9%A2%98%E8%A7%A3/"/>
    
    
    <category term="前缀和" scheme="https://luumod.github.io/tags/%E5%89%8D%E7%BC%80%E5%92%8C/"/>
    
  </entry>
  
  <entry>
    <title>CMake学习（1）- 基本操作与命令</title>
    <link href="https://luumod.github.io/2023/03/20/CMake%E5%AD%A6%E4%B9%A0%EF%BC%881%EF%BC%89-%E5%9F%BA%E6%9C%AC%E6%93%8D%E4%BD%9C%E4%B8%8E%E5%91%BD%E4%BB%A4/"/>
    <id>https://luumod.github.io/2023/03/20/CMake%E5%AD%A6%E4%B9%A0%EF%BC%881%EF%BC%89-%E5%9F%BA%E6%9C%AC%E6%93%8D%E4%BD%9C%E4%B8%8E%E5%91%BD%E4%BB%A4/</id>
    <published>2023-03-20T09:24:43.000Z</published>
    <updated>2023-03-20T13:53:27.125Z</updated>
    
    
    <summary type="html">本文主要是对CMake学习的总结。包含基本操作与第一个简单的CMake程序及指令详解</summary>
    
    
    
    <category term="实用技术" scheme="https://luumod.github.io/categories/%E5%AE%9E%E7%94%A8%E6%8A%80%E6%9C%AF/"/>
    
    
    <category term="CMake" scheme="https://luumod.github.io/tags/CMake/"/>
    
  </entry>
  
  <entry>
    <title>树状数组解决逆序对问题</title>
    <link href="https://luumod.github.io/2023/03/18/%E6%A0%91%E7%8A%B6%E6%95%B0%E7%BB%84%E8%A7%A3%E5%86%B3%E9%80%86%E5%BA%8F%E5%AF%B9%E9%97%AE%E9%A2%98/"/>
    <id>https://luumod.github.io/2023/03/18/%E6%A0%91%E7%8A%B6%E6%95%B0%E7%BB%84%E8%A7%A3%E5%86%B3%E9%80%86%E5%BA%8F%E5%AF%B9%E9%97%AE%E9%A2%98/</id>
    <published>2023-03-18T13:10:33.000Z</published>
    <updated>2023-03-23T16:12:39.265Z</updated>
    
    
    <summary type="html">使用树状数组解决逆序对问题：详细解析+完整AC代码</summary>
    
    
    
    <category term="算法题解" scheme="https://luumod.github.io/categories/%E7%AE%97%E6%B3%95%E9%A2%98%E8%A7%A3/"/>
    
    
    <category term="树状数组" scheme="https://luumod.github.io/tags/%E6%A0%91%E7%8A%B6%E6%95%B0%E7%BB%84/"/>
    
  </entry>
  
  <entry>
    <title>Python学习（2） - NumPy矩阵与通用函数</title>
    <link href="https://luumod.github.io/2023/03/17/Python%E5%AD%A6%E4%B9%A0%EF%BC%882%EF%BC%89-NumPy%E7%9F%A9%E9%98%B5%E4%B8%8E%E9%80%9A%E7%94%A8%E5%87%BD%E6%95%B0/"/>
    <id>https://luumod.github.io/2023/03/17/Python%E5%AD%A6%E4%B9%A0%EF%BC%882%EF%BC%89-NumPy%E7%9F%A9%E9%98%B5%E4%B8%8E%E9%80%9A%E7%94%A8%E5%87%BD%E6%95%B0/</id>
    <published>2023-03-17T04:55:39.000Z</published>
    <updated>2023-03-17T09:49:35.313Z</updated>
    
    
    <summary type="html">本文主要讲解了NumPy矩阵的创建与ufunc操作函数，包括排序，去重，等基本函数</summary>
    
    
    
    <category term="Python数据分析" scheme="https://luumod.github.io/categories/Python%E6%95%B0%E6%8D%AE%E5%88%86%E6%9E%90/"/>
    
    
    <category term="NumPy" scheme="https://luumod.github.io/tags/NumPy/"/>
    
  </entry>
  
  <entry>
    <title>并查集及其扩展</title>
    <link href="https://luumod.github.io/2023/03/16/%E5%B9%B6%E6%9F%A5%E9%9B%86%E5%8F%8A%E5%85%B6%E6%89%A9%E5%B1%95/"/>
    <id>https://luumod.github.io/2023/03/16/%E5%B9%B6%E6%9F%A5%E9%9B%86%E5%8F%8A%E5%85%B6%E6%89%A9%E5%B1%95/</id>
    <published>2023-03-16T14:41:15.000Z</published>
    <updated>2023-03-23T16:12:27.765Z</updated>
    
    
    <summary type="html">本文主要讲解了并查集的相关应用，以及并查集的扩展（种类并查集，带权并查集等等）并且附带题目联系及完整代码</summary>
    
    
    
    <category term="算法题解" scheme="https://luumod.github.io/categories/%E7%AE%97%E6%B3%95%E9%A2%98%E8%A7%A3/"/>
    
    
    <category term="并查集" scheme="https://luumod.github.io/tags/%E5%B9%B6%E6%9F%A5%E9%9B%86/"/>
    
  </entry>
  
  <entry>
    <title>Python学习（1）-NumPy数组操作</title>
    <link href="https://luumod.github.io/2023/03/15/Python%E5%AD%A6%E4%B9%A0%EF%BC%881%EF%BC%89-NumPy%E6%95%B0%E7%BB%84%E6%93%8D%E4%BD%9C/"/>
    <id>https://luumod.github.io/2023/03/15/Python%E5%AD%A6%E4%B9%A0%EF%BC%881%EF%BC%89-NumPy%E6%95%B0%E7%BB%84%E6%93%8D%E4%BD%9C/</id>
    <published>2023-03-15T05:31:14.000Z</published>
    <updated>2023-03-17T09:48:53.546Z</updated>
    
    
    <summary type="html">本文主要讲解了Python - NumPy的ndarray中的数组的操作，包括数组的创建，访问，改变形状等函数及功能</summary>
    
    
    
    <category term="Python数据分析" scheme="https://luumod.github.io/categories/Python%E6%95%B0%E6%8D%AE%E5%88%86%E6%9E%90/"/>
    
    
    <category term="NumPy" scheme="https://luumod.github.io/tags/NumPy/"/>
    
  </entry>
  
</feed>
