﻿<?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++博客-&lt;font size=7 color=red&gt;littlekid&lt;/font&gt;-随笔分类-Standing Programs</title><link>http://www.cppblog.com/littlekid/category/5495.html</link><description>&lt;br&gt;
&lt;font size=3 color=red align=right&gt;
littlekid@R2
&lt;/font&gt;</description><language>zh-cn</language><lastBuildDate>Mon, 19 May 2008 17:51:55 GMT</lastBuildDate><pubDate>Mon, 19 May 2008 17:51:55 GMT</pubDate><ttl>60</ttl><item><title>【图论】【Dijstra】最短奇偶路径</title><link>http://www.cppblog.com/littlekid/archive/2008/04/01/Dijstra_C_version1.html</link><dc:creator>littlekid@R2</dc:creator><author>littlekid@R2</author><pubDate>Tue, 01 Apr 2008 06:47:00 GMT</pubDate><guid>http://www.cppblog.com/littlekid/archive/2008/04/01/Dijstra_C_version1.html</guid><wfw:comment>http://www.cppblog.com/littlekid/comments/45917.html</wfw:comment><comments>http://www.cppblog.com/littlekid/archive/2008/04/01/Dijstra_C_version1.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/littlekid/comments/commentRss/45917.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/littlekid/services/trackbacks/45917.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: WHU08CC_PRE之path解题报告<br>我的Dijstra＋优先队列标准程序&nbsp;&nbsp;<a href='http://www.cppblog.com/littlekid/archive/2008/04/01/Dijstra_C_version1.html'>阅读全文</a><img src ="http://www.cppblog.com/littlekid/aggbug/45917.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/littlekid/" target="_blank">littlekid@R2</a> 2008-04-01 14:47 <a href="http://www.cppblog.com/littlekid/archive/2008/04/01/Dijstra_C_version1.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ1771Elevator Stopping Plan的解答</title><link>http://www.cppblog.com/littlekid/archive/2007/10/29/35477.html</link><dc:creator>littlekid@R2</dc:creator><author>littlekid@R2</author><pubDate>Mon, 29 Oct 2007 13:35:00 GMT</pubDate><guid>http://www.cppblog.com/littlekid/archive/2007/10/29/35477.html</guid><wfw:comment>http://www.cppblog.com/littlekid/comments/35477.html</wfw:comment><comments>http://www.cppblog.com/littlekid/archive/2007/10/29/35477.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/littlekid/comments/commentRss/35477.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/littlekid/services/trackbacks/35477.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 这个题目原来比赛WA了，后来一直没有做出来，最近比赛又遇上，郁闷地想了好几天，我在网上没有找到正确答案，昨天向tank请教，终于知道了算法，今天AC了，写出来吧&#8230;&#8230;题目来源：ICPC2003广州赛区题目网址：http...&nbsp;&nbsp;<a href='http://www.cppblog.com/littlekid/archive/2007/10/29/35477.html'>阅读全文</a><img src ="http://www.cppblog.com/littlekid/aggbug/35477.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/littlekid/" target="_blank">littlekid@R2</a> 2007-10-29 21:35 <a href="http://www.cppblog.com/littlekid/archive/2007/10/29/35477.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>