﻿<?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++博客-Xredman驿站-随笔分类-字符串</title><link>http://www.cppblog.com/xredman/category/10487.html</link><description /><language>zh-cn</language><lastBuildDate>Sun, 10 May 2009 06:25:26 GMT</lastBuildDate><pubDate>Sun, 10 May 2009 06:25:26 GMT</pubDate><ttl>60</ttl><item><title>HDOJ1711(Number Sequence)</title><link>http://www.cppblog.com/xredman/archive/2009/05/10/82461.html</link><dc:creator>Xredman</dc:creator><author>Xredman</author><pubDate>Sun, 10 May 2009 03:10:00 GMT</pubDate><guid>http://www.cppblog.com/xredman/archive/2009/05/10/82461.html</guid><wfw:comment>http://www.cppblog.com/xredman/comments/82461.html</wfw:comment><comments>http://www.cppblog.com/xredman/archive/2009/05/10/82461.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xredman/comments/commentRss/82461.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xredman/services/trackbacks/82461.html</trackback:ping><description><![CDATA[<span style="FONT-SIZE: 14pt; FONT-FAMILY: 楷体_GB2312">&nbsp;2009-05-10 11:04:54 Accepted 1711 515MS 4192K 944 B C++ <br>KMP算法最普通的运用</span>
<img src ="http://www.cppblog.com/xredman/aggbug/82461.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xredman/" target="_blank">Xredman</a> 2009-05-10 11:10 <a href="http://www.cppblog.com/xredman/archive/2009/05/10/82461.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ3461（Oulipo）</title><link>http://www.cppblog.com/xredman/archive/2009/05/10/82454.html</link><dc:creator>Xredman</dc:creator><author>Xredman</author><pubDate>Sun, 10 May 2009 02:00:00 GMT</pubDate><guid>http://www.cppblog.com/xredman/archive/2009/05/10/82454.html</guid><wfw:comment>http://www.cppblog.com/xredman/comments/82454.html</wfw:comment><comments>http://www.cppblog.com/xredman/archive/2009/05/10/82454.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xredman/comments/commentRss/82454.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xredman/services/trackbacks/82454.html</trackback:ping><description><![CDATA[<span style="FONT-SIZE: 18pt; FONT-FAMILY: 楷体_GB2312">/*<br>&nbsp;POJ3461(Oulipo)<br>&nbsp;Accepted 5108K 141MS C++ 901B 2009-05-10 09:48:46 <br>&nbsp;&nbsp;by Xredman<br>*/<br>&nbsp;本题为纯粹的KMP算法，其变化仅在于返回值不是匹配串首次在模式串中出现的位置，而是匹配串在模式串中出现的次数。 </span>
<img src ="http://www.cppblog.com/xredman/aggbug/82454.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xredman/" target="_blank">Xredman</a> 2009-05-10 10:00 <a href="http://www.cppblog.com/xredman/archive/2009/05/10/82454.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>