<?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>Treap on Inftopia</title>
    <link>https://inftress.pages.dev/tags/treap/</link>
    <description>Recent content in Treap on Inftopia</description>
    <generator>Hugo</generator>
    <language>zh-cn</language>
    <lastBuildDate>Wed, 24 Jun 2026 22:45:29 +0800</lastBuildDate>
    <atom:link href="https://inftress.pages.dev/tags/treap/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>二进制序列与查询</title>
      <link>https://inftress.pages.dev/posts/%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%BA%8F%E5%88%97%E4%B8%8E%E6%9F%A5%E8%AF%A2/</link>
      <pubDate>Wed, 24 Jun 2026 22:45:29 +0800</pubDate>
      <guid>https://inftress.pages.dev/posts/%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%BA%8F%E5%88%97%E4%B8%8E%E6%9F%A5%E8%AF%A2/</guid>
      <description>&lt;p&gt;这个题目还是相当简单的吧。&lt;/p&gt;
&lt;p&gt;你直接考虑用平衡树维护段长。&lt;/p&gt;
&lt;p&gt;然后直接区间取最大即可。&lt;/p&gt;
&lt;p&gt;糖丸了。&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
