﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-忽若流星</title><link>http://www.cppblog.com/yuyang7/</link><description /><language>zh-cn</language><lastBuildDate>Tue, 14 Apr 2026 23:09:20 GMT</lastBuildDate><pubDate>Tue, 14 Apr 2026 23:09:20 GMT</pubDate><ttl>60</ttl><item><title>Permutation—全排列</title><link>http://www.cppblog.com/yuyang7/archive/2009/03/30/78403.html</link><dc:creator>yuyang7</dc:creator><author>yuyang7</author><pubDate>Mon, 30 Mar 2009 12:56:00 GMT</pubDate><guid>http://www.cppblog.com/yuyang7/archive/2009/03/30/78403.html</guid><wfw:comment>http://www.cppblog.com/yuyang7/comments/78403.html</wfw:comment><comments>http://www.cppblog.com/yuyang7/archive/2009/03/30/78403.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/yuyang7/comments/commentRss/78403.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/yuyang7/services/trackbacks/78403.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 一个全排列是从一个有限集中选取元素，组成一个有序的序列，并且所有的元素出现且仅出现一次。&nbsp;&nbsp;<a href='http://www.cppblog.com/yuyang7/archive/2009/03/30/78403.html'>阅读全文</a><img src ="http://www.cppblog.com/yuyang7/aggbug/78403.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/yuyang7/" target="_blank">yuyang7</a> 2009-03-30 20:56 <a href="http://www.cppblog.com/yuyang7/archive/2009/03/30/78403.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>从一道简单题谈程序设计的思维（续）</title><link>http://www.cppblog.com/yuyang7/archive/2009/03/29/78326.html</link><dc:creator>yuyang7</dc:creator><author>yuyang7</author><pubDate>Sun, 29 Mar 2009 15:38:00 GMT</pubDate><guid>http://www.cppblog.com/yuyang7/archive/2009/03/29/78326.html</guid><wfw:comment>http://www.cppblog.com/yuyang7/comments/78326.html</wfw:comment><comments>http://www.cppblog.com/yuyang7/archive/2009/03/29/78326.html#Feedback</comments><slash:comments>9</slash:comments><wfw:commentRss>http://www.cppblog.com/yuyang7/comments/commentRss/78326.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/yuyang7/services/trackbacks/78326.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 题意是对于给定的n（n为奇数）根木棒，其中有n - 1根是可以按长度配对的，找出按长度配对后剩余的一根木棒。&nbsp;&nbsp;<a href='http://www.cppblog.com/yuyang7/archive/2009/03/29/78326.html'>阅读全文</a><img src ="http://www.cppblog.com/yuyang7/aggbug/78326.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/yuyang7/" target="_blank">yuyang7</a> 2009-03-29 23:38 <a href="http://www.cppblog.com/yuyang7/archive/2009/03/29/78326.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>从一道简单题谈程序设计的思维</title><link>http://www.cppblog.com/yuyang7/archive/2009/03/29/78268.html</link><dc:creator>yuyang7</dc:creator><author>yuyang7</author><pubDate>Sun, 29 Mar 2009 07:35:00 GMT</pubDate><guid>http://www.cppblog.com/yuyang7/archive/2009/03/29/78268.html</guid><wfw:comment>http://www.cppblog.com/yuyang7/comments/78268.html</wfw:comment><comments>http://www.cppblog.com/yuyang7/archive/2009/03/29/78268.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/yuyang7/comments/commentRss/78268.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/yuyang7/services/trackbacks/78268.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 一道ACM的简单题，却隐藏着你意想不到的解法。你能想到它吗？&nbsp;&nbsp;<a href='http://www.cppblog.com/yuyang7/archive/2009/03/29/78268.html'>阅读全文</a><img src ="http://www.cppblog.com/yuyang7/aggbug/78268.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/yuyang7/" target="_blank">yuyang7</a> 2009-03-29 15:35 <a href="http://www.cppblog.com/yuyang7/archive/2009/03/29/78268.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Suffix Tree—后缀树</title><link>http://www.cppblog.com/yuyang7/archive/2009/03/29/78252.html</link><dc:creator>yuyang7</dc:creator><author>yuyang7</author><pubDate>Sun, 29 Mar 2009 05:05:00 GMT</pubDate><guid>http://www.cppblog.com/yuyang7/archive/2009/03/29/78252.html</guid><wfw:comment>http://www.cppblog.com/yuyang7/comments/78252.html</wfw:comment><comments>http://www.cppblog.com/yuyang7/archive/2009/03/29/78252.html#Feedback</comments><slash:comments>8</slash:comments><wfw:commentRss>http://www.cppblog.com/yuyang7/comments/commentRss/78252.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/yuyang7/services/trackbacks/78252.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 后缀树是一种PAT树，它描述了给定字符串的所有后缀，许多重要的字符串操作都能够在后缀树上快速地实现。&nbsp;&nbsp;<a href='http://www.cppblog.com/yuyang7/archive/2009/03/29/78252.html'>阅读全文</a><img src ="http://www.cppblog.com/yuyang7/aggbug/78252.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/yuyang7/" target="_blank">yuyang7</a> 2009-03-29 13:05 <a href="http://www.cppblog.com/yuyang7/archive/2009/03/29/78252.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Trie在程序设计竞赛中的应用</title><link>http://www.cppblog.com/yuyang7/archive/2009/03/28/78124.html</link><dc:creator>yuyang7</dc:creator><author>yuyang7</author><pubDate>Sat, 28 Mar 2009 03:45:00 GMT</pubDate><guid>http://www.cppblog.com/yuyang7/archive/2009/03/28/78124.html</guid><wfw:comment>http://www.cppblog.com/yuyang7/comments/78124.html</wfw:comment><comments>http://www.cppblog.com/yuyang7/archive/2009/03/28/78124.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/yuyang7/comments/commentRss/78124.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/yuyang7/services/trackbacks/78124.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: Trie在程序设计竞赛中的应用&nbsp;&nbsp;<a href='http://www.cppblog.com/yuyang7/archive/2009/03/28/78124.html'>阅读全文</a><img src ="http://www.cppblog.com/yuyang7/aggbug/78124.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/yuyang7/" target="_blank">yuyang7</a> 2009-03-28 11:45 <a href="http://www.cppblog.com/yuyang7/archive/2009/03/28/78124.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Trie—单词查找树</title><link>http://www.cppblog.com/yuyang7/archive/2009/03/27/78083.html</link><dc:creator>yuyang7</dc:creator><author>yuyang7</author><pubDate>Fri, 27 Mar 2009 15:51:00 GMT</pubDate><guid>http://www.cppblog.com/yuyang7/archive/2009/03/27/78083.html</guid><wfw:comment>http://www.cppblog.com/yuyang7/comments/78083.html</wfw:comment><comments>http://www.cppblog.com/yuyang7/archive/2009/03/27/78083.html#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://www.cppblog.com/yuyang7/comments/commentRss/78083.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/yuyang7/services/trackbacks/78083.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: Trie，又称单词查找树、前缀树，是一种哈希树的变种。应用于字符串的统计与排序，经常被搜索引擎系统用于文本词频统计。<br><br>&nbsp;&nbsp;<a href='http://www.cppblog.com/yuyang7/archive/2009/03/27/78083.html'>阅读全文</a><img src ="http://www.cppblog.com/yuyang7/aggbug/78083.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/yuyang7/" target="_blank">yuyang7</a> 2009-03-27 23:51 <a href="http://www.cppblog.com/yuyang7/archive/2009/03/27/78083.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>