<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
  <channel>
    <title>算法 - 分类 - coldheart&#39;s blog</title>
    <link>http://example.org/categories/%E7%AE%97%E6%B3%95/</link>
    <description>算法 - 分类 - coldheart&#39;s blog</description>
    <generator>Hugo -- gohugo.io</generator><language>zh-CN</language><lastBuildDate>Mon, 26 Nov 2018 17:30:39 &#43;0000</lastBuildDate><atom:link href="http://example.org/categories/%E7%AE%97%E6%B3%95/" rel="self" type="application/rss+xml" /><item>
  <title>蓝桥杯T35 危险系数（DFS）</title>
  <link>http://example.org/posts/%E8%93%9D%E6%A1%A5%E6%9D%AFt35-%E5%8D%B1%E9%99%A9%E7%B3%BB%E6%95%B0dfs/</link>
  <pubDate>Mon, 26 Nov 2018 17:30:39 &#43;0000</pubDate>
  <author>coldheart</author>
  <guid>http://example.org/posts/%E8%93%9D%E6%A1%A5%E6%9D%AFt35-%E5%8D%B1%E9%99%A9%E7%B3%BB%E6%95%B0dfs/</guid>
  <description><![CDATA[Description 抗日战争时期，冀中平原的地道战曾发挥重要作用。 地道的多个站点间有通道连接，形成了庞大的网络。但也有隐患，当敌人发现了某个站点后，其它站点间]]></description>
</item><item>
  <title>基础练习 字符串对比</title>
  <link>http://example.org/posts/%E5%9F%BA%E7%A1%80%E7%BB%83%E4%B9%A0-%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%AF%B9%E6%AF%94/</link>
  <pubDate>Wed, 07 Nov 2018 23:06:49 &#43;0000</pubDate>
  <author>coldheart</author>
  <guid>http://example.org/posts/%E5%9F%BA%E7%A1%80%E7%BB%83%E4%B9%A0-%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%AF%B9%E6%AF%94/</guid>
  <description><![CDATA[Description 给定两个仅由大写字母或小写字母组成的字符串(长度介于1到10之间)，它们之间的关 系是以下4中情况之一： 1：两个字符串长度不等。比如 Beijing 和 Hebei 2]]></description>
</item><item>
  <title>Almost Sorted Array(O(NlogN)LIS)</title>
  <link>http://example.org/posts/almost-sorted-array-o-nlogn-lis/</link>
  <pubDate>Thu, 16 Aug 2018 20:34:41 &#43;0000</pubDate>
  <author>coldheart</author>
  <guid>http://example.org/posts/almost-sorted-array-o-nlogn-lis/</guid>
  <description><![CDATA[Almost Sorted Array（nlogn的LIS） We are all familiar with sorting algorithms: quick sort, merge sort, heap sort, insertion sort, selection sort, bubble sort, etc. But sometimes it is an overkill to use these algorithms for an almost sorted array. We say an array is sorted if its elements are in non-decreasing order or non-increasing order. We]]></description>
</item><item>
  <title>洛谷P1618 三连击(升级版) (暴力全排列枚举)</title>
  <link>http://example.org/posts/%E6%B4%9B%E8%B0%B7p1618-%E4%B8%89%E8%BF%9E%E5%87%BB-%E5%8D%87%E7%BA%A7%E7%89%88-%E6%9A%B4%E5%8A%9B%E5%85%A8%E6%8E%92%E5%88%97%E6%9E%9A%E4%B8%BE/</link>
  <pubDate>Thu, 09 Aug 2018 16:45:31 &#43;0000</pubDate>
  <author>coldheart</author>
  <guid>http://example.org/posts/%E6%B4%9B%E8%B0%B7p1618-%E4%B8%89%E8%BF%9E%E5%87%BB-%E5%8D%87%E7%BA%A7%E7%89%88-%E6%9A%B4%E5%8A%9B%E5%85%A8%E6%8E%92%E5%88%97%E6%9E%9A%E4%B8%BE/</guid>
  <description><![CDATA[洛谷P1618 三连击(升级版) (暴力全排列枚举) 题目描述 将1，2，…，9共9个数分成三组，分别组成三个三位数，且使这三个三位数的比例是A:B]]></description>
</item><item>
  <title>CF758D Ability To Convert(贪心模拟)</title>
  <link>http://example.org/posts/cf758d-ability-to-convert-%E8%B4%AA%E5%BF%83%E6%A8%A1%E6%8B%9F/</link>
  <pubDate>Thu, 09 Aug 2018 15:23:30 &#43;0000</pubDate>
  <author>coldheart</author>
  <guid>http://example.org/posts/cf758d-ability-to-convert-%E8%B4%AA%E5%BF%83%E6%A8%A1%E6%8B%9F/</guid>
  <description><![CDATA[CF758D Ability To Convert(贪心模拟) 题目描述 Alexander is learning how to convert numbers from the decimal system to any other, however, he doesn&rsquo;t know English letters, so he writes any number only as a decimal number, it means that instead of the letter A he will write the number 10. Thus, by converting the number 475]]></description>
</item><item>
  <title>[USACO1.5]回文质数 Prime Palindromes</title>
  <link>http://example.org/posts/usaco1-5-%E5%9B%9E%E6%96%87%E8%B4%A8%E6%95%B0-prime-palindromes/</link>
  <pubDate>Tue, 07 Aug 2018 19:08:58 &#43;0000</pubDate>
  <author>coldheart</author>
  <guid>http://example.org/posts/usaco1-5-%E5%9B%9E%E6%96%87%E8%B4%A8%E6%95%B0-prime-palindromes/</guid>
  <description><![CDATA[题目描述 因为151既是一个质数又是一个回文数(从左到右和从右到左是看一样的)，所以 151 是回文质数。 写一个程序来找出范围[a,b](5 &lt;= a &lt; b &lt;=]]></description>
</item><item>
  <title>洛谷P1032 字串变换(BFS&#43;STL字符串处理)</title>
  <link>http://example.org/posts/%E6%B4%9B%E8%B0%B7p1032-%E5%AD%97%E4%B8%B2%E5%8F%98%E6%8D%A2-bfs-stl%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%A4%84%E7%90%86/</link>
  <pubDate>Tue, 07 Aug 2018 15:10:36 &#43;0000</pubDate>
  <author>coldheart</author>
  <guid>http://example.org/posts/%E6%B4%9B%E8%B0%B7p1032-%E5%AD%97%E4%B8%B2%E5%8F%98%E6%8D%A2-bfs-stl%E5%AD%97%E7%AC%A6%E4%B8%B2%E5%A4%84%E7%90%86/</guid>
  <description><![CDATA[洛谷P1032 字串变换(BFS+STL字符串处理) 题目描述 已知有两个字串 A,BA,B 及一组字串变换的规则（至多 66 个规则）: A1 -&gt; B1 A2 -&gt; B2 规则的含义为：在]]></description>
</item><item>
  <title>洛谷1162 填涂颜色(DFS漫水填充法)</title>
  <link>http://example.org/posts/p%E6%B4%9B%E8%B0%B71162-%E5%A1%AB%E6%B6%82%E9%A2%9C%E8%89%B2-dfs%E6%BC%AB%E6%B0%B4%E5%A1%AB%E5%85%85%E6%B3%95/</link>
  <pubDate>Mon, 06 Aug 2018 13:21:06 &#43;0000</pubDate>
  <author>coldheart</author>
  <guid>http://example.org/posts/p%E6%B4%9B%E8%B0%B71162-%E5%A1%AB%E6%B6%82%E9%A2%9C%E8%89%B2-dfs%E6%BC%AB%E6%B0%B4%E5%A1%AB%E5%85%85%E6%B3%95/</guid>
  <description><![CDATA[洛谷1162 填涂颜色(DFS漫水填充法) 题目描述 由数字 0组成的方阵中，有一任意形状闭合圈，闭合圈由数字 1 构成，围圈时只走上下左右 4 个方向。现]]></description>
</item><item>
  <title>一些BFS题集</title>
  <link>http://example.org/posts/%E4%B8%80%E4%BA%9Bbfs%E9%A2%98%E9%9B%86/</link>
  <pubDate>Sat, 04 Aug 2018 21:01:00 &#43;0000</pubDate>
  <author>coldheart</author>
  <guid>http://example.org/posts/%E4%B8%80%E4%BA%9Bbfs%E9%A2%98%E9%9B%86/</guid>
  <description><![CDATA[一些BFS题集 A计划 可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后，而今，不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃]]></description>
</item><item>
  <title>TJOI2013 黄金矿工(01背包改)</title>
  <link>http://example.org/posts/tjoi2013-%E9%BB%84%E9%87%91%E7%9F%BF%E5%B7%A5-01%E8%83%8C%E5%8C%85%E6%94%B9/</link>
  <pubDate>Thu, 02 Aug 2018 09:56:38 &#43;0000</pubDate>
  <author>coldheart</author>
  <guid>http://example.org/posts/tjoi2013-%E9%BB%84%E9%87%91%E7%9F%BF%E5%B7%A5-01%E8%83%8C%E5%8C%85%E6%94%B9/</guid>
  <description><![CDATA[题目描述 小A最近迷上了在上课时玩《黄金矿工》这款游戏。为了避免被老师发现,他必须小心翼翼,因此他总是输。在输掉自己所有的金币后,他向你求助。]]></description>
</item></channel>
</rss>
