<?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>LCA on 寒寒的博客</title><link>https://blog.alikia2x.com/tags/lca/</link><description>Recent content in LCA on 寒寒的博客</description><generator>Hugo -- gohugo.io</generator><language>zh</language><lastBuildDate>Mon, 15 Jul 2024 22:24:16 +0800</lastBuildDate><atom:link href="https://blog.alikia2x.com/tags/lca/index.xml" rel="self" type="application/rss+xml"/><item><title>使用倍增法实现LCA（最近公共祖先）查询</title><link>https://blog.alikia2x.com/posts/lca-binary-lifting/</link><pubDate>Mon, 15 Jul 2024 22:24:16 +0800</pubDate><guid>https://blog.alikia2x.com/posts/lca-binary-lifting/</guid><description>暑假来临，寒寒参加OI集训，今日学到了如何使用倍增法查找一颗树的LCA（最近公共祖先），故在此分享。</description></item></channel></rss>