<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Dodola is writing here. · 归档</title><description>归档更新</description><link>https://example.invalid/</link><item><title>关键渲染路径（CRP）的详细步骤</title><link>https://example.invalid/archive/tech-frontend-critical-rendering-path/</link><guid isPermaLink="true">https://example.invalid/archive/tech-frontend-critical-rendering-path/</guid><description>关键渲染路径 指的是浏览器将 HTML、CSS 和 Java</description><pubDate>Wed, 08 Oct 2025 00:00:00 GMT</pubDate></item><item><title>DNS 查询简述</title><link>https://example.invalid/archive/tech-frontend-dns-query/</link><guid isPermaLink="true">https://example.invalid/archive/tech-frontend-dns-query/</guid><description>[!abstract]+ 简单比喻：电话簿查询 想象一下你要</description><pubDate>Wed, 08 Oct 2025 00:00:00 GMT</pubDate></item><item><title>JavaScript 垃圾回收机制简述</title><link>https://example.invalid/archive/tech-frontend-js-garbage-collection/</link><guid isPermaLink="true">https://example.invalid/archive/tech-frontend-js-garbage-collection/</guid><description>JavaScript 是一种 具有自动垃圾回收 的语言。这意</description><pubDate>Wed, 08 Oct 2025 00:00:00 GMT</pubDate></item><item><title>JavaScript 原型链简述</title><link>https://example.invalid/archive/tech-frontend-js-prototype-chain/</link><guid isPermaLink="true">https://example.invalid/archive/tech-frontend-js-prototype-chain/</guid><description>JavaScript 是一种面向对象语言，是一种基于原型的语</description><pubDate>Wed, 08 Oct 2025 00:00:00 GMT</pubDate></item><item><title>JavaScript 模块打包器 Rollup</title><link>https://example.invalid/archive/tech-frontend-js-rollup/</link><guid isPermaLink="true">https://example.invalid/archive/tech-frontend-js-rollup/</guid><description>Rollup 是一个 JavaScript 模块打包器 。它</description><pubDate>Wed, 08 Oct 2025 00:00:00 GMT</pubDate></item><item><title>CSS 选择器优先级和覆盖样式</title><link>https://example.invalid/archive/tech-frontend-css-style-level/</link><guid isPermaLink="true">https://example.invalid/archive/tech-frontend-css-style-level/</guid><description>CSS 选择器优先级计算规则 CSS 选择器优先级通过权重系</description><pubDate>Thu, 02 Oct 2025 00:00:00 GMT</pubDate></item><item><title>Margin 折叠</title><link>https://example.invalid/archive/tech-frontend-margin-fold/</link><guid isPermaLink="true">https://example.invalid/archive/tech-frontend-margin-fold/</guid><description>一句话概括 当两个或多个垂直相邻的块级元素的 margin</description><pubDate>Thu, 02 Oct 2025 00:00:00 GMT</pubDate></item><item><title>Intersection Observer API 监听是否进入了可视区域</title><link>https://example.invalid/archive/tech-frontend-intersection-observer-api/</link><guid isPermaLink="true">https://example.invalid/archive/tech-frontend-intersection-observer-api/</guid><description>API 介绍 Intersection Observer A</description><pubDate>Wed, 17 Sep 2025 00:00:00 GMT</pubDate></item><item><title>我的 oh-my-posh 上都有哪些配置</title><link>https://example.invalid/archive/tech-tools-my-win-shell/</link><guid isPermaLink="true">https://example.invalid/archive/tech-tools-my-win-shell/</guid><description>What 在 Windows 上使用的是 WSL2(fish</description><pubDate>Fri, 22 Aug 2025 00:00:00 GMT</pubDate></item><item><title>🧩带图标的 Blog 跳转链接</title><link>https://example.invalid/archive/projects-themes-plugins-favicon-link/</link><guid isPermaLink="true">https://example.invalid/archive/projects-themes-plugins-favicon-link/</guid><description>将在线链接升级成可以预览网页图标的样子 quartz 主题中</description><pubDate>Wed, 20 Aug 2025 00:00:00 GMT</pubDate></item><item><title>为最近笔记添加排序和筛选</title><link>https://example.invalid/archive/projects-themes-plugins-use-filter-and-sort/</link><guid isPermaLink="true">https://example.invalid/archive/projects-themes-plugins-use-filter-and-sort/</guid><description>有时候会更新一些目录页说明，更新说明时会出现博客左上角的“最</description><pubDate>Fri, 01 Aug 2025 00:00:00 GMT</pubDate></item><item><title>🔑Git环境配置和SSH公钥设置</title><link>https://example.invalid/archive/tech-tools-git-settings/</link><guid isPermaLink="true">https://example.invalid/archive/tech-tools-git-settings/</guid><description>一般远程仓库都支持使用 ssh 访问和读写数据，提供 ssh</description><pubDate>Fri, 01 Aug 2025 00:00:00 GMT</pubDate></item><item><title>💻常用 xcode 使用命令</title><link>https://example.invalid/archive/tech-tools-xcode-commands/</link><guid isPermaLink="true">https://example.invalid/archive/tech-tools-xcode-commands/</guid><description>[!abstract]+ Xcode 介绍 Xcode 是苹</description><pubDate>Fri, 01 Aug 2025 00:00:00 GMT</pubDate></item><item><title>在 quartz 主题中给博客添加封面首图</title><link>https://example.invalid/archive/projects-themes-plugins-add-featured-image/</link><guid isPermaLink="true">https://example.invalid/archive/projects-themes-plugins-add-featured-image/</guid><description>上一个主题可以在博客首部设置一张自定义的图片，也一直觉得这样</description><pubDate>Sun, 27 Jul 2025 00:00:00 GMT</pubDate></item><item><title>🌐URL 重写规则和静态资源解析逻辑</title><link>https://example.invalid/archive/tech-tools-url-rewrite-rule/</link><guid isPermaLink="true">https://example.invalid/archive/tech-tools-url-rewrite-rule/</guid><description>无后缀url应该如何匹配？</description><pubDate>Mon, 14 Jul 2025 00:00:00 GMT</pubDate></item><item><title>Electron 构建记录 | 一条龙服务script</title><link>https://example.invalid/archive/tech-electronjs-build-electron/</link><guid isPermaLink="true">https://example.invalid/archive/tech-electronjs-build-electron/</guid><description>Electron 构建记录，排错记录流水账</description><pubDate>Fri, 25 Apr 2025 00:00:00 GMT</pubDate></item><item><title>前端流量控制常用手段</title><link>https://example.invalid/archive/tech-frontend-flow-control/</link><guid isPermaLink="true">https://example.invalid/archive/tech-frontend-flow-control/</guid><description>[!abstract]+ 问题描述 如何解决页面请求接口的大</description><pubDate>Mon, 17 Mar 2025 00:00:00 GMT</pubDate></item><item><title>大文件上传和下载问题</title><link>https://example.invalid/archive/tech-frontend-large-file-upload/</link><guid isPermaLink="true">https://example.invalid/archive/tech-frontend-large-file-upload/</guid><description>[!abstract]+ 问题预设 网络断开之后，之前上传的</description><pubDate>Mon, 17 Mar 2025 00:00:00 GMT</pubDate></item><item><title>JavaScript 链式调用设计模式 | Vue举例</title><link>https://example.invalid/archive/tech-frontend-method-chaining/</link><guid isPermaLink="true">https://example.invalid/archive/tech-frontend-method-chaining/</guid><description>Vue :从 createApp 开始的链式调用 代码示例</description><pubDate>Mon, 17 Mar 2025 00:00:00 GMT</pubDate></item><item><title>LeetCode Hot 100记录（19/100）</title><link>https://example.invalid/archive/algorithm-topics-lchot100/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-topics-lchot100/</guid><description>哈希(3/3) 两数之和 题意 给定一个整数数组 nums</description><pubDate>Thu, 13 Mar 2025 00:00:00 GMT</pubDate></item><item><title>八股文短代码 Coding 篇</title><link>https://example.invalid/archive/tech-frontend-frontend-coding-notes/</link><guid isPermaLink="true">https://example.invalid/archive/tech-frontend-frontend-coding-notes/</guid><description>代码：千分位逗号 代码：手写深浅拷贝 浅拷贝只会复制对象的顶</description><pubDate>Thu, 13 Mar 2025 00:00:00 GMT</pubDate></item><item><title>🦀Rust编程区块链项目 BlockChain in Rust</title><link>https://example.invalid/archive/projects-toys-intro-block-chain/</link><guid isPermaLink="true">https://example.invalid/archive/projects-toys-intro-block-chain/</guid><description>[!info]- GitHub仓库地址 GitHub 仓库地</description><pubDate>Mon, 03 Mar 2025 00:00:00 GMT</pubDate></item><item><title>🎈2025牛客暑寒假多校训练营Day4</title><link>https://example.invalid/archive/algorithm-contest-nc25wd4/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc25wd4/</guid><description>A 题意 数据范围 思路 代码 B Tokitsukaze</description><pubDate>Sun, 02 Mar 2025 00:00:00 GMT</pubDate></item><item><title>🎈2025牛客暑寒假多校训练营Day3（完結）</title><link>https://example.invalid/archive/algorithm-contest-nc25wd3/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc25wd3/</guid><description>A 智乃的博弈游戏 题意 有一堆$n$个石子，每次可以拿走$</description><pubDate>Sun, 16 Feb 2025 00:00:00 GMT</pubDate></item><item><title>🎈2025牛客暑寒假多校训练营Day2</title><link>https://example.invalid/archive/algorithm-contest-nc25wd2/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc25wd2/</guid><description>A 一起奏响历史之音！ 题意 中国传统五声调中包含 1、2、</description><pubDate>Wed, 05 Feb 2025 00:00:00 GMT</pubDate></item><item><title>🎈2025牛客暑寒假多校训练营Day1（完結）</title><link>https://example.invalid/archive/algorithm-contest-nc25wd1/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc25wd1/</guid><description>A 茕茕孑立之影 题意 找一个不超过$1e18$的数$x$，</description><pubDate>Thu, 23 Jan 2025 00:00:00 GMT</pubDate></item><item><title>💭Codeforces Round 990 (Div. 2)</title><link>https://example.invalid/archive/algorithm-contest-cfround990div2/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-cfround990div2/</guid><description>A. Alyona and a Square Jigsaw</description><pubDate>Thu, 05 Dec 2024 00:00:00 GMT</pubDate></item><item><title>💭Codeforces Round 980 (Div. 2)</title><link>https://example.invalid/archive/algorithm-contest-cfround980div2/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-cfround980div2/</guid><description>A. Profitable Interest Rate 题意</description><pubDate>Tue, 26 Nov 2024 00:00:00 GMT</pubDate></item><item><title>2023杭州ICPC区域赛</title><link>https://example.invalid/archive/algorithm-icpc-ccpc-23-hang-zhou-icpc/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-icpc-ccpc-23-hang-zhou-icpc/</guid><description>G. Snake Move 题意 $n	imes m$的网</description><pubDate>Sat, 23 Nov 2024 00:00:00 GMT</pubDate></item><item><title>💭Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round)</title><link>https://example.invalid/archive/algorithm-contest-cfround977div2/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-cfround977div2/</guid><description>💭Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round)</description><pubDate>Fri, 25 Oct 2024 00:00:00 GMT</pubDate></item><item><title>刷题记录||区间动态规划</title><link>https://example.invalid/archive/algorithm-topics-intervaldp/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-topics-intervaldp/</guid><description>区间动态规划一般以区间作为动态规划的阶段。 [P1880]石</description><pubDate>Wed, 11 Sep 2024 00:00:00 GMT</pubDate></item><item><title>线段树专题练习</title><link>https://example.invalid/archive/algorithm-topics-segtree-practice/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-topics-segtree-practice/</guid><description>[!abstract]+ 反思中 痛定思痛练习线段树QAQ。</description><pubDate>Fri, 16 Aug 2024 00:00:00 GMT</pubDate></item><item><title>🫟2024牛客暑假多校训练营Day10||补题</title><link>https://example.invalid/archive/algorithm-contest-nc24sd10/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc24sd10/</guid><description>A-Surrender to My Will 题意 根据上票</description><pubDate>Thu, 15 Aug 2024 00:00:00 GMT</pubDate></item><item><title>🫟2024牛客暑假多校训练营Day7||补题</title><link>https://example.invalid/archive/algorithm-contest-nc24sd7/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc24sd7/</guid><description>I-Fight Against the Monster 题意</description><pubDate>Thu, 08 Aug 2024 00:00:00 GMT</pubDate></item><item><title>🫟2024牛客暑假多校训练营Day8||补题</title><link>https://example.invalid/archive/algorithm-contest-nc24sd8/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc24sd8/</guid><description>A-Haitang and Game 题意 给出一个数组，两</description><pubDate>Thu, 08 Aug 2024 00:00:00 GMT</pubDate></item><item><title>🫟2024牛客暑假多校训练营Day6||补题</title><link>https://example.invalid/archive/algorithm-contest-nc24sd6/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc24sd6/</guid><description>A-Cake 题意 Oscar 和 Grammy 玩游戏，第</description><pubDate>Mon, 05 Aug 2024 00:00:00 GMT</pubDate></item><item><title>🫟2024牛客暑假多校训练营Day4||补题</title><link>https://example.invalid/archive/algorithm-contest-nc24sd4/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc24sd4/</guid><description>A-LCT 题意 给定一棵有根树，每次询问前$i$条边组成的</description><pubDate>Wed, 31 Jul 2024 00:00:00 GMT</pubDate></item><item><title>🫟2024牛客暑假多校训练营Day5||补题</title><link>https://example.invalid/archive/algorithm-contest-nc24sd5/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc24sd5/</guid><description>TODO</description><pubDate>Wed, 31 Jul 2024 00:00:00 GMT</pubDate></item><item><title>🫟2024牛客暑假多校训练营Day3||补题</title><link>https://example.invalid/archive/algorithm-contest-nc24sd3/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc24sd3/</guid><description>A-Bridging the Gap 2 题意 在河岸的一侧</description><pubDate>Tue, 23 Jul 2024 00:00:00 GMT</pubDate></item><item><title>2024杭电钉耙编程联赛Day1||补题</title><link>https://example.invalid/archive/algorithm-contest-hdu24sd1/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-hdu24sd1/</guid><description>1001-循环位移 $(709/3775)$ 题意 将字符串</description><pubDate>Fri, 19 Jul 2024 00:00:00 GMT</pubDate></item><item><title>🫟2024牛客暑假多校训练营Day2||补题</title><link>https://example.invalid/archive/algorithm-contest-nc24sd2/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc24sd2/</guid><description>A-Floor Tiles 题意 存在 A型 、 B型 两种</description><pubDate>Fri, 19 Jul 2024 00:00:00 GMT</pubDate></item><item><title>🫟2024牛客暑假多校训练营Day1||补题</title><link>https://example.invalid/archive/algorithm-contest-nc24sd1/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc24sd1/</guid><description>A-Bit Common 题意 计算满足长度为$n$，每个元</description><pubDate>Tue, 16 Jul 2024 00:00:00 GMT</pubDate></item><item><title>购物车页面制作教程（包含分页设计）</title><link>https://example.invalid/archive/tech-frontend-cart-page-sample/</link><guid isPermaLink="true">https://example.invalid/archive/tech-frontend-cart-page-sample/</guid><description>一篇用于从零开始，基于原生H5C3JS制作的购物车页面</description><pubDate>Sat, 06 Jul 2024 00:00:00 GMT</pubDate></item><item><title>2024吉林省赛补题记录</title><link>https://example.invalid/archive/algorithm-icpc-ccpc-24-jilin-ccpc/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-icpc-ccpc-24-jilin-ccpc/</guid><description>GYM地址：2024吉林省赛 题目顺序按照从易到难排序。 I</description><pubDate>Fri, 05 Jul 2024 00:00:00 GMT</pubDate></item><item><title>🙆‍♀️Github Action实践</title><link>https://example.invalid/archive/tech-tools-github-action/</link><guid isPermaLink="true">https://example.invalid/archive/tech-tools-github-action/</guid><description>前言 本篇记录利用 github action 实现自动化构</description><pubDate>Fri, 05 Jul 2024 00:00:00 GMT</pubDate></item><item><title>💛友達です！</title><link>https://example.invalid/archive/links/</link><guid isPermaLink="true">https://example.invalid/archive/links/</guid><description>友链 挂挂</description><pubDate>Thu, 04 Jul 2024 00:00:00 GMT</pubDate></item><item><title>🧪CS-APP Datalab</title><link>https://example.invalid/archive/projects-datalab/</link><guid isPermaLink="true">https://example.invalid/archive/projects-datalab/</guid><description>记录CS-APP Datalab实验过程</description><pubDate>Thu, 04 Jul 2024 00:00:00 GMT</pubDate></item><item><title>MutationObserver学习+实践</title><link>https://example.invalid/archive/tech-frontend-mutation-observer/</link><guid isPermaLink="true">https://example.invalid/archive/tech-frontend-mutation-observer/</guid><description>一篇学习 MutationObserver 的文章 背景 今</description><pubDate>Thu, 04 Jul 2024 00:00:00 GMT</pubDate></item><item><title>💭Codeforces Round 930(div2)</title><link>https://example.invalid/archive/algorithm-contest-cfround930div2/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-cfround930div2/</guid><description>A-Shuffle Party 题意 对一个数组，起初是$a</description><pubDate>Wed, 13 Mar 2024 00:00:00 GMT</pubDate></item><item><title>💭Codeforces Round 931(div2)</title><link>https://example.invalid/archive/algorithm-contest-cfround931div2/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-cfround931div2/</guid><description>A-Too Min Too Max 题意 对一个数组，找到索</description><pubDate>Wed, 13 Mar 2024 00:00:00 GMT</pubDate></item><item><title>💭Codeforces Round 932(div2)</title><link>https://example.invalid/archive/algorithm-contest-cfround932div2/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-cfround932div2/</guid><description>A-Entertainment in MAC 题意 可以对一</description><pubDate>Wed, 13 Mar 2024 00:00:00 GMT</pubDate></item><item><title>💭Codeforces Round 933(div3)</title><link>https://example.invalid/archive/algorithm-contest-cfround933div3/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-cfround933div3/</guid><description>A-Rudolf and the Ticket 题意 左边口</description><pubDate>Wed, 13 Mar 2024 00:00:00 GMT</pubDate></item><item><title>线段树讲义||寒假</title><link>https://example.invalid/archive/algorithm-topics-segtreelecnote/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-topics-segtreelecnote/</guid><description>线段树介绍 线段树是一棵二叉树，每个节点维护一个区间内$[l</description><pubDate>Wed, 13 Mar 2024 00:00:00 GMT</pubDate></item><item><title>刷题记录||线性动态规划</title><link>https://example.invalid/archive/algorithm-topics-lineardp/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-topics-lineardp/</guid><description>线性动态规划 线性动态规划，即具有线性阶段划分的动态规划。</description><pubDate>Sat, 09 Mar 2024 00:00:00 GMT</pubDate></item><item><title>💭Educational Codeforces Round 162(div2)</title><link>https://example.invalid/archive/algorithm-contest-cfedu162div2/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-cfedu162div2/</guid><description>A-Moving Chips 题意 每个单元格为空闲或有一个</description><pubDate>Thu, 29 Feb 2024 00:00:00 GMT</pubDate></item><item><title>💭Codeforces Round 927(div3)</title><link>https://example.invalid/archive/algorithm-contest-cfround927div3/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-cfround927div3/</guid><description>A-Thorns and Coins 题意 长度为$n$的单</description><pubDate>Thu, 29 Feb 2024 00:00:00 GMT</pubDate></item><item><title>💭Codeforces Round 929(div3)</title><link>https://example.invalid/archive/algorithm-contest-cfround929div3/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-cfround929div3/</guid><description>A-Turtle Puzzle: Rearrange and</description><pubDate>Thu, 29 Feb 2024 00:00:00 GMT</pubDate></item><item><title>🎉2024牛客寒假营4||补题</title><link>https://example.invalid/archive/algorithm-contest-nc24wd4/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc24wd4/</guid><description>2024牛客寒假营4||补题的题解记录</description><pubDate>Mon, 26 Feb 2024 00:00:00 GMT</pubDate></item><item><title>🎉2024牛客寒假营6||补题</title><link>https://example.invalid/archive/algorithm-contest-nc24wd6/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc24wd6/</guid><description>A-宇宙的终结 题意 在$[l,r]$中寻找某个恰好是三个不</description><pubDate>Mon, 26 Feb 2024 00:00:00 GMT</pubDate></item><item><title>🎉2024牛客寒假营5||补题</title><link>https://example.invalid/archive/algorithm-contest-nc24wd5/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc24wd5/</guid><description>A-mutsumi的质数合数 题意 一个由$n$个正整数组成</description><pubDate>Wed, 21 Feb 2024 00:00:00 GMT</pubDate></item><item><title>🎉2024牛客寒假营3||补题</title><link>https://example.invalid/archive/algorithm-contest-nc24wd3/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc24wd3/</guid><description>A-智乃与瞩目狸猫、幸运水母、月宫龙虾 题意 在不考虑单词词</description><pubDate>Tue, 13 Feb 2024 00:00:00 GMT</pubDate></item><item><title>🎉2024牛客寒假营2||补题</title><link>https://example.invalid/archive/algorithm-contest-nc24wd2/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc24wd2/</guid><description>A-Tokitsukaze and Bracelet 题意</description><pubDate>Fri, 09 Feb 2024 00:00:00 GMT</pubDate></item><item><title>🎉2024牛客寒假营1||补题</title><link>https://example.invalid/archive/algorithm-contest-nc24wd1/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-contest-nc24wd1/</guid><description>A-DFS搜索 题意 给一个字符串，判断其中是否包含 dfs</description><pubDate>Fri, 02 Feb 2024 00:00:00 GMT</pubDate></item><item><title>图论基础||存储图||DFS、BFS(图论)</title><link>https://example.invalid/archive/algorithm-topics-graph-basic/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-topics-graph-basic/</guid><description>1.1图的定义 上课讲过一大堆这里不再赘述，直接学习代码实现</description><pubDate>Sat, 06 Jan 2024 00:00:00 GMT</pubDate></item><item><title>线段树模板</title><link>https://example.invalid/archive/algorithm-topics-seg-tree/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-topics-seg-tree/</guid><description>线段树(segment tree) 线段树主要用于维护区间信</description><pubDate>Sat, 06 Jan 2024 00:00:00 GMT</pubDate></item><item><title>字符串匹配问题||前缀函数+KMP+字符串哈希</title><link>https://example.invalid/archive/algorithm-topics-string-match/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-topics-string-match/</guid><description>字符串匹配算法 暴力做法(BF) 简称BF(Brute Fo</description><pubDate>Fri, 05 Jan 2024 00:00:00 GMT</pubDate></item><item><title>拓扑排序</title><link>https://example.invalid/archive/algorithm-topics-topo/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-topics-topo/</guid><description>拓扑排序 前提：拓扑排序是对 有向无环图 来说的，无向图、有</description><pubDate>Fri, 05 Jan 2024 00:00:00 GMT</pubDate></item><item><title>最短路问题（Dijkstra + SPFA + Floyd）</title><link>https://example.invalid/archive/algorithm-topics-shortest-path/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-topics-shortest-path/</guid><description>思维先行 我们要找某点到某点的最短路径(记为点u到点v)，这</description><pubDate>Sat, 23 Dec 2023 00:00:00 GMT</pubDate></item><item><title>NENU2023学年算法2例题</title><link>https://example.invalid/archive/algorithm-topics-nenuoj/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-topics-nenuoj/</guid><description>有的题还没写完）咕咕咕）） NENU OJ算法2例题 这学期</description><pubDate>Tue, 19 Dec 2023 00:00:00 GMT</pubDate></item><item><title>队内拉题记录||23.11.29</title><link>https://example.invalid/archive/algorithm-topics-training0/</link><guid isPermaLink="true">https://example.invalid/archive/algorithm-topics-training0/</guid><description>前言点评：本次题目难度不高 A 跳石头 [NOIP2015</description><pubDate>Sat, 02 Dec 2023 00:00:00 GMT</pubDate></item></channel></rss>