<?xml version="1.0" encoding="utf-8"?><?xml-stylesheet href='http://feeds.feedsky.com/styles/temp01.xsl' type='text/xsl' ?><!--这是一个由Feedsy提供技术支持的Feed，为了提高读者阅读的体验，以及满足用户美化自己Feed的需要，我们设计了多种精美的Feed模板，提供给大家选择，所有最终呈现出来的样式，皆由用户自愿选择使用，未经许可，任何团体和个人，请不要擅自修改样式或者盗用，这是对于用户选择权的尊重。--><rss xmlns:atom="http://www.w3.org/2005/Atom" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:fs="http://www.feedsky.com/namespace/feed" version="2.0"><channel><atom:link href="http://feeds.feedsky.com/csdn.net/acumon" type="application/rss+xml" ref="self"></atom:link><lastBuildDate>Thu, 24 Aug 2006 00:15:00 GMT</lastBuildDate><title>Acumon's Treasures</title><description>我的博采园 　　——关注算法设计、AS、C++、国家大事和身边小事</description><link>http://blog.csdn.net/acumon/</link><item><title>标程：并查集API</title><link>http://item.feedsky.com/~csdn.net/acumon/~1210038/22790643/1210012/1/item.html</link><wfw:comment>http://blog.csdn.net/acumon/comments/1109913.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/acumon/comments/commentRss/1109913.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1109913</trackback:ping><description>这是自写的并查集标程。树状合并、带路径压缩的并查集可以以最大O(logN),平均O(1)的复杂度完成合并与测试操作。&lt;img src =&quot;http://blog.csdn.net/acumon/aggbug/1109913.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Thu, 24 Aug 2006 08:15:00 +0800</pubDate><author>踏雪赤兔</author><comments>http://blog.csdn.net/acumon/archive/2006/08/24/1109913.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/acumon/archive/2006/08/24/1109913.aspx</guid><dc:creator>踏雪赤兔</dc:creator><fs:srclink>http://blog.csdn.net/acumon/archive/2006/08/24/1109913.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/acumon/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/acumon/~1210038/22790643/1210012</fs:itemid></item><item><title>标程：经典图算法</title><link>http://item.feedsky.com/~csdn.net/acumon/~1210038/22790645/1210012/1/item.html</link><wfw:comment>http://blog.csdn.net/acumon/comments/1109788.aspx</wfw:comment><slash:comments>-2</slash:comments><wfw:commentRss>http://blog.csdn.net/acumon/comments/commentRss/1109788.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1109788</trackback:ping><description>本标程介绍了一些经典的图论算法，C++描述。&lt;img src =&quot;http://blog.csdn.net/acumon/aggbug/1109788.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Thu, 24 Aug 2006 07:17:00 +0800</pubDate><author>踏雪赤兔</author><comments>http://blog.csdn.net/acumon/archive/2006/08/23/1109788.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/acumon/archive/2006/08/23/1109788.aspx</guid><dc:creator>踏雪赤兔</dc:creator><fs:srclink>http://blog.csdn.net/acumon/archive/2006/08/23/1109788.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/acumon/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/acumon/~1210038/22790645/1210012</fs:itemid></item><item><title>标程：优先队列类</title><link>http://item.feedsky.com/~csdn.net/acumon/~1210038/22790646/1210012/1/item.html</link><wfw:comment>http://blog.csdn.net/acumon/comments/1109736.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/acumon/comments/commentRss/1109736.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1109736</trackback:ping><description>本例程演示了STL heap的一个最重要的应用——实现优先队列。并将其方法封装到一个PQ类中
&lt;img src =&quot;http://blog.csdn.net/acumon/aggbug/1109736.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Thu, 24 Aug 2006 06:43:00 +0800</pubDate><author>踏雪赤兔</author><comments>http://blog.csdn.net/acumon/archive/2006/08/23/1109736.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/acumon/archive/2006/08/23/1109736.aspx</guid><dc:creator>踏雪赤兔</dc:creator><fs:srclink>http://blog.csdn.net/acumon/archive/2006/08/23/1109736.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/acumon/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/acumon/~1210038/22790646/1210012</fs:itemid></item></channel></rss>