<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>线段树 on Song Kai's Blog</title><link>https://myblog-43r.pages.dev/tags/%E7%BA%BF%E6%AE%B5%E6%A0%91/</link><description>Recent content in 线段树 on Song Kai's Blog</description><generator>Hugo</generator><language>zh-cn</language><lastBuildDate>Tue, 02 Jun 2026 09:15:27 +0800</lastBuildDate><atom:link href="https://myblog-43r.pages.dev/tags/%E7%BA%BF%E6%AE%B5%E6%A0%91/index.xml" rel="self" type="application/rss+xml"/><item><title>标准线段树笔记（Java版）</title><link>https://myblog-43r.pages.dev/posts/segment-tree-notes/</link><pubDate>Tue, 02 Jun 2026 09:15:27 +0800</pubDate><guid>https://myblog-43r.pages.dev/posts/segment-tree-notes/</guid><description>&lt;p>线段树是我觉得最值得先掌握的区间数据结构之一。它不难，但第一次学的时候，容易被“递归建树”“区间拆分”“下标映射”这些细节绕住。把它拆开看，其实只有三件事：建树、查询、修改。&lt;/p></description></item></channel></rss>