﻿<?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/runafterfree/category/17569.html</link><description /><language>zh-cn</language><lastBuildDate>Fri, 19 Aug 2011 11:13:53 GMT</lastBuildDate><pubDate>Fri, 19 Aug 2011 11:13:53 GMT</pubDate><ttl>60</ttl><item><title>poj1163从三角形顶点走到底边的最长路径</title><link>http://www.cppblog.com/runafterfree/archive/2011/08/19/153871.html</link><dc:creator>成成</dc:creator><author>成成</author><pubDate>Fri, 19 Aug 2011 09:33:00 GMT</pubDate><guid>http://www.cppblog.com/runafterfree/archive/2011/08/19/153871.html</guid><wfw:comment>http://www.cppblog.com/runafterfree/comments/153871.html</wfw:comment><comments>http://www.cppblog.com/runafterfree/archive/2011/08/19/153871.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/runafterfree/comments/commentRss/153871.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/runafterfree/services/trackbacks/153871.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: poj1163，简单动态规划&nbsp;&nbsp;<a href='http://www.cppblog.com/runafterfree/archive/2011/08/19/153871.html'>阅读全文</a><img src ="http://www.cppblog.com/runafterfree/aggbug/153871.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/runafterfree/" target="_blank">成成</a> 2011-08-19 17:33 <a href="http://www.cppblog.com/runafterfree/archive/2011/08/19/153871.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>