<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Data Structure on EtaoinWu</title>
    <link>https://etaoinwu.com/tags/data-structure/</link>
    <description>Recent content in Data Structure on EtaoinWu</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>zh-hans-cn</language>
    
    
    <lastBuildDate>Fri, 23 Oct 2020 17:34:17 +0800</lastBuildDate><atom:link href="https://etaoinwu.com/tags/data-structure/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>平衡树的串接与拆分</title>
      <link>https://etaoinwu.com/blog/%E5%B9%B3%E8%A1%A1%E6%A0%91%E7%9A%84%E4%B8%B2%E6%8E%A5%E4%B8%8E%E6%8B%86%E5%88%86/</link>
      <pubDate>Fri, 23 Oct 2020 17:34:17 +0800</pubDate>
      
      <guid>https://etaoinwu.com/blog/%E5%B9%B3%E8%A1%A1%E6%A0%91%E7%9A%84%E4%B8%B2%E6%8E%A5%E4%B8%8E%E6%8B%86%E5%88%86/</guid>
      <description>简要地讨论一下一些平衡树（AVL、Treap、Splay等）的值域不交的串接和拆分的问题，还附带讨论了一下
Finger Search。</description>
    </item>
    
    <item>
      <title>动态图连通性的 Holm-de Lichtenberg-Thorup 算法</title>
      <link>https://etaoinwu.com/blog/fully-dynamic-connectivity/</link>
      <pubDate>Thu, 17 Oct 2019 21:58:38 +0800</pubDate>
      
      <guid>https://etaoinwu.com/blog/fully-dynamic-connectivity/</guid>
      <description>算是LOJ
122的一个官方题解吧…带加边删边地维护一张图，支持连通性查询。</description>
    </item>
    
    <item>
      <title>配对堆与赋级配对堆（Rank Pairing Heaps）</title>
      <link>https://etaoinwu.com/blog/pairing-heaps-and-rank-pairing-heaps/</link>
      <pubDate>Tue, 02 Jul 2019 14:50:25 +0800</pubDate>
      
      <guid>https://etaoinwu.com/blog/pairing-heaps-and-rank-pairing-heaps/</guid>
      <description>后者是一种实践上较快、复杂度优越的可并可删堆。</description>
    </item>
    
    <item>
      <title>Top Tree 学习笔记</title>
      <link>https://etaoinwu.com/blog/top-tree-notes/</link>
      <pubDate>Mon, 20 Aug 2018 17:34:00 +0000</pubDate>
      
      <guid>https://etaoinwu.com/blog/top-tree-notes/</guid>
      <description>一篇写给自己看的 top tree 的笔记，慎入</description>
    </item>
    
    <item>
      <title>线性时间区间最值（RMQ）算法</title>
      <link>https://etaoinwu.com/blog/rmq-in-linear-time/</link>
      <pubDate>Sun, 30 Apr 2017 17:00:00 +0000</pubDate>
      
      <guid>https://etaoinwu.com/blog/rmq-in-linear-time/</guid>
      <description>尝试了一下线性时间的RMQ算法。</description>
    </item>
    
    <item>
      <title>欧拉回路树</title>
      <link>https://etaoinwu.com/blog/euler-tour-tree/</link>
      <pubDate>Wed, 16 Nov 2016 19:44:00 +0000</pubDate>
      
      <guid>https://etaoinwu.com/blog/euler-tour-tree/</guid>
      <description>以边为中心、子树为导向的动态数——欧拉回路树</description>
    </item>
    
  </channel>
</rss>