﻿<?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++博客-ACFirst-随笔分类-动态规划</title><link>http://www.cppblog.com/zzfmars/category/14370.html</link><description>行胜于言，孤行无益，思为行先。有所为，有所不为。</description><language>zh-cn</language><lastBuildDate>Mon, 23 Aug 2010 02:49:49 GMT</lastBuildDate><pubDate>Mon, 23 Aug 2010 02:49:49 GMT</pubDate><ttl>60</ttl><item><title>pku1080</title><link>http://www.cppblog.com/zzfmars/archive/2010/08/21/124215.html</link><dc:creator>Kevin_Zhang</dc:creator><author>Kevin_Zhang</author><pubDate>Sat, 21 Aug 2010 13:43:00 GMT</pubDate><guid>http://www.cppblog.com/zzfmars/archive/2010/08/21/124215.html</guid><wfw:comment>http://www.cppblog.com/zzfmars/comments/124215.html</wfw:comment><comments>http://www.cppblog.com/zzfmars/archive/2010/08/21/124215.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/zzfmars/comments/commentRss/124215.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/zzfmars/services/trackbacks/124215.html</trackback:ping><description><![CDATA[原来是道简单的动态规划题目，一开始怎么就没看出来呢。这道题可以说是最大公共子序列的进化版，而且进化的不少，求最大匹配值。可见经典算法的重要性，动态规划问题的思路就是寻找 状态转移方程 和初始条件。最优子结构性质，由子问题的答案来构造问题的答案。思考时，应按照思路这样测试，而不是很泛泛的思考，没有思维策略。<br>
<img src ="http://www.cppblog.com/zzfmars/aggbug/124215.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zzfmars/" target="_blank">Kevin_Zhang</a> 2010-08-21 21:43 <a href="http://www.cppblog.com/zzfmars/archive/2010/08/21/124215.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>