﻿<?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/R2D2/</link><description /><language>zh-cn</language><lastBuildDate>Tue, 14 Apr 2026 23:06:15 GMT</lastBuildDate><pubDate>Tue, 14 Apr 2026 23:06:15 GMT</pubDate><ttl>60</ttl><item><title>【拓扑排序】我写poj1094的过程 </title><link>http://www.cppblog.com/R2D2/archive/2008/01/11/40962.html</link><dc:creator>R2D2</dc:creator><author>R2D2</author><pubDate>Fri, 11 Jan 2008 07:48:00 GMT</pubDate><guid>http://www.cppblog.com/R2D2/archive/2008/01/11/40962.html</guid><wfw:comment>http://www.cppblog.com/R2D2/comments/40962.html</wfw:comment><comments>http://www.cppblog.com/R2D2/archive/2008/01/11/40962.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/R2D2/comments/commentRss/40962.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/R2D2/services/trackbacks/40962.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;&nbsp; 好久没写程序练手了，今天本来准备拿POJ1025开刀的，但是1025这个模拟题目太繁杂了，换一个，写POJ1094，结果郁闷地写了三个多小时——代码水平有待提升呀。&nbsp;&nbsp;&nbsp;&nbsp; 下面是我写这个题目的详细过程，跟大家分享下：题目地址：http://acm.pku.edu.cn/JudgeOnline/problem?id=10...&nbsp;&nbsp;<a href='http://www.cppblog.com/R2D2/archive/2008/01/11/40962.html'>阅读全文</a><img src ="http://www.cppblog.com/R2D2/aggbug/40962.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/R2D2/" target="_blank">R2D2</a> 2008-01-11 15:48 <a href="http://www.cppblog.com/R2D2/archive/2008/01/11/40962.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【DP】POJ1141  Brackets Sequence解题报告</title><link>http://www.cppblog.com/R2D2/archive/2008/01/09/POJ1141.html</link><dc:creator>R2D2</dc:creator><author>R2D2</author><pubDate>Wed, 09 Jan 2008 13:33:00 GMT</pubDate><guid>http://www.cppblog.com/R2D2/archive/2008/01/09/POJ1141.html</guid><wfw:comment>http://www.cppblog.com/R2D2/comments/40828.html</wfw:comment><comments>http://www.cppblog.com/R2D2/archive/2008/01/09/POJ1141.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/R2D2/comments/commentRss/40828.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/R2D2/services/trackbacks/40828.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: //o(&#8745;_&#8745;)o...哈哈，我回来做题了&#8230;&#8230;POJ1141是一个经典DP题，是一个&#8220;历史遗留&#8221;问题了。一个简单版本WOJ1077：Dragonflywww http://acm.whu.edu.cn/oak/problem/problem.jsp?problem_id=1077题目描述：&nbsp;&nbsp;&nbsp;&...&nbsp;&nbsp;<a href='http://www.cppblog.com/R2D2/archive/2008/01/09/POJ1141.html'>阅读全文</a><img src ="http://www.cppblog.com/R2D2/aggbug/40828.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/R2D2/" target="_blank">R2D2</a> 2008-01-09 21:33 <a href="http://www.cppblog.com/R2D2/archive/2008/01/09/POJ1141.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>