<?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>OI on Alikia's Blog</title><link>https://blog.alikia2x.com/en/tags/oi/</link><description>Recent content in OI on Alikia's Blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><lastBuildDate>Mon, 15 Jul 2024 22:24:16 +0800</lastBuildDate><atom:link href="https://blog.alikia2x.com/en/tags/oi/index.xml" rel="self" type="application/rss+xml"/><item><title>Implementing LCA (Lowest Common Ancestor) Query Using Binary Lifting</title><link>https://blog.alikia2x.com/en/posts/lca-binary-lifting/</link><pubDate>Mon, 15 Jul 2024 22:24:16 +0800</pubDate><guid>https://blog.alikia2x.com/en/posts/lca-binary-lifting/</guid><description>Here&amp;rsquo;s a implemention of finding LCA in C++ with detailed comments to help you understand this algorithm.</description></item></channel></rss>