<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
  <channel>
    <title>树状数组 - 标签 - coldheart&#39;s blog</title>
    <link>http://example.org/tags/%E6%A0%91%E7%8A%B6%E6%95%B0%E7%BB%84/</link>
    <description>树状数组 - 标签 - coldheart&#39;s blog</description>
    <generator>Hugo -- gohugo.io</generator><language>zh-CN</language><lastBuildDate>Mon, 30 Jul 2018 19:21:31 &#43;0000</lastBuildDate><atom:link href="http://example.org/tags/%E6%A0%91%E7%8A%B6%E6%95%B0%E7%BB%84/" rel="self" type="application/rss+xml" /><item>
  <title>树状数组简单梳理（上）</title>
  <link>http://example.org/posts/%E6%A0%91%E7%8A%B6%E6%95%B0%E7%BB%84%E7%AE%80%E5%8D%95%E6%A2%B3%E7%90%86%E4%B8%8A/</link>
  <pubDate>Mon, 30 Jul 2018 19:21:31 &#43;0000</pubDate>
  <author>coldheart</author>
  <guid>http://example.org/posts/%E6%A0%91%E7%8A%B6%E6%95%B0%E7%BB%84%E7%AE%80%E5%8D%95%E6%A2%B3%E7%90%86%E4%B8%8A/</guid>
  <description><![CDATA[树状数组简单梳理（上） 背景 平时做题时我们经常会碰到一类问题： 有一个数组，多次往这个数组上某个点的值增加k，再多次求数组上某个区间所有数组之和]]></description>
</item><item>
  <title>ZCMU1156 新年彩灯1(树状数组区间更新单点查询)</title>
  <link>http://example.org/posts/zcmu1156-%E6%96%B0%E5%B9%B4%E5%BD%A9%E7%81%AF1-%E6%A0%91%E7%8A%B6%E6%95%B0%E7%BB%84%E5%8C%BA%E9%97%B4%E6%9B%B4%E6%96%B0%E5%8D%95%E7%82%B9%E6%9F%A5%E8%AF%A2/</link>
  <pubDate>Sun, 29 Jul 2018 19:00:55 &#43;0000</pubDate>
  <author>coldheart</author>
  <guid>http://example.org/posts/zcmu1156-%E6%96%B0%E5%B9%B4%E5%BD%A9%E7%81%AF1-%E6%A0%91%E7%8A%B6%E6%95%B0%E7%BB%84%E5%8C%BA%E9%97%B4%E6%9B%B4%E6%96%B0%E5%8D%95%E7%82%B9%E6%9F%A5%E8%AF%A2/</guid>
  <description><![CDATA[ZCMU1156 新年彩灯 Description 新年将至，YY准备挂一排彩灯，已知彩灯刚挂完的彩灯共有N盏（编号为1,2,3,……），并且都是灭的。彩灯的闪烁由一段程序控制。 每]]></description>
</item><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>
