﻿<?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++博客-lentty</title><link>http://www.cppblog.com/lentty/</link><description /><language>zh-cn</language><lastBuildDate>Tue, 09 Jun 2026 17:40:37 GMT</lastBuildDate><pubDate>Tue, 09 Jun 2026 17:40:37 GMT</pubDate><ttl>60</ttl><item><title>TOJ 3520 BFS+记录路径 POJ 2488 DFS+记录路径</title><link>http://www.cppblog.com/lentty/archive/2012/07/04/181414.html</link><dc:creator>lentty</dc:creator><author>lentty</author><pubDate>Wed, 04 Jul 2012 14:48:00 GMT</pubDate><guid>http://www.cppblog.com/lentty/archive/2012/07/04/181414.html</guid><wfw:comment>http://www.cppblog.com/lentty/comments/181414.html</wfw:comment><comments>http://www.cppblog.com/lentty/archive/2012/07/04/181414.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/lentty/comments/commentRss/181414.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/lentty/services/trackbacks/181414.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: TOJ 3520 BFS记录路径，每次记录它的前驱，然后从目标点递归回去找出路径 Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-->#include&lt;stdio.h&gt;#include&lt;string.h&gt;#include&lt;...&nbsp;&nbsp;<a href='http://www.cppblog.com/lentty/archive/2012/07/04/181414.html'>阅读全文</a><img src ="http://www.cppblog.com/lentty/aggbug/181414.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/lentty/" target="_blank">lentty</a> 2012-07-04 22:48 <a href="http://www.cppblog.com/lentty/archive/2012/07/04/181414.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>