<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
  <channel>
    <title>离线查询 - 标签 - coldheart&#39;s blog</title>
    <link>http://example.org/tags/%E7%A6%BB%E7%BA%BF%E6%9F%A5%E8%AF%A2/</link>
    <description>离线查询 - 标签 - coldheart&#39;s blog</description>
    <generator>Hugo -- gohugo.io</generator><language>zh-CN</language><lastBuildDate>Mon, 23 Jul 2018 13:33:34 &#43;0000</lastBuildDate><atom:link href="http://example.org/tags/%E7%A6%BB%E7%BA%BF%E6%9F%A5%E8%AF%A2/" rel="self" type="application/rss+xml" /><item>
  <title>牛客网 Different Integers</title>
  <link>http://example.org/posts/%E7%89%9B%E5%AE%A2%E7%BD%91-different-integers/</link>
  <pubDate>Mon, 23 Jul 2018 13:33:34 &#43;0000</pubDate>
  <author>coldheart</author>
  <guid>http://example.org/posts/%E7%89%9B%E5%AE%A2%E7%BD%91-different-integers/</guid>
  <description><![CDATA[牛客网 Different Integers 题目描述 Given a sequence of integers a1, a2, &hellip;, an and q pairs of integers (l1, r1), (l2, r2), &hellip;, (lq, rq), find count(l1, r1), count(l2, r2), &hellip;, count(lq, rq) where count(i, j) is the number of different integers among a1, a2, &hellip;, ai, aj, aj + 1, &hellip;, an. 输入描述 The input consists of several test cases and]]></description>
</item></channel>
</rss>
