﻿<?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++博客-tclh123</title><link>http://www.cppblog.com/tclh123/</link><description /><language>zh-cn</language><lastBuildDate>Thu, 23 Apr 2026 10:09:42 GMT</lastBuildDate><pubDate>Thu, 23 Apr 2026 10:09:42 GMT</pubDate><ttl>60</ttl><item><title>博客移至CSDN  http://blog.csdn.net/tclh123</title><link>http://www.cppblog.com/tclh123/archive/2011/08/15/153454.html</link><dc:creator>泳裤王子</dc:creator><author>泳裤王子</author><pubDate>Mon, 15 Aug 2011 09:17:00 GMT</pubDate><guid>http://www.cppblog.com/tclh123/archive/2011/08/15/153454.html</guid><wfw:comment>http://www.cppblog.com/tclh123/comments/153454.html</wfw:comment><comments>http://www.cppblog.com/tclh123/archive/2011/08/15/153454.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/tclh123/comments/commentRss/153454.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/tclh123/services/trackbacks/153454.html</trackback:ping><description><![CDATA[如题<br /><div>博客移至CSDN &nbsp;<a href="博客移至CSDN  http://blog.csdn.net/tclh123">http://blog.csdn.net/tclh123</a>。欢迎访问。</div><img src ="http://www.cppblog.com/tclh123/aggbug/153454.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/tclh123/" target="_blank">泳裤王子</a> 2011-08-15 17:17 <a href="http://www.cppblog.com/tclh123/archive/2011/08/15/153454.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>wor</title><link>http://www.cppblog.com/tclh123/archive/2011/03/27/142813.html</link><dc:creator>泳裤王子</dc:creator><author>泳裤王子</author><pubDate>Sun, 27 Mar 2011 14:37:00 GMT</pubDate><guid>http://www.cppblog.com/tclh123/archive/2011/03/27/142813.html</guid><wfw:comment>http://www.cppblog.com/tclh123/comments/142813.html</wfw:comment><comments>http://www.cppblog.com/tclh123/archive/2011/03/27/142813.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/tclh123/comments/commentRss/142813.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/tclh123/services/trackbacks/142813.html</trackback:ping><description><![CDATA[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=114&page=show_problem&problem=47

题目大意：判断 两个排列 的 最多 相同的相对位置（顺序）。

题目类型：简单dp，最长公共子序列，最长单增子序列。（注意串和序列的区别）

分析：解法一：把序列sort，然后就变成求它与原序列的最长公共子串问题了。
         
         解法二：按最长单增子序列做，最后变成求d的最大值。

代码：
                            另外，此题表述相当有问题。看看第二个样例就知道，靠，白白害我郁闷调了一晚上，擦。
            果断鄙视之。   
Kao 
<img src ="http://www.cppblog.com/tclh123/aggbug/142813.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/tclh123/" target="_blank">泳裤王子</a> 2011-03-27 22:37 <a href="http://www.cppblog.com/tclh123/archive/2011/03/27/142813.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>1</title><link>http://www.cppblog.com/tclh123/archive/2011/03/27/142812.html</link><dc:creator>泳裤王子</dc:creator><author>泳裤王子</author><pubDate>Sun, 27 Mar 2011 14:35:00 GMT</pubDate><guid>http://www.cppblog.com/tclh123/archive/2011/03/27/142812.html</guid><wfw:comment>http://www.cppblog.com/tclh123/comments/142812.html</wfw:comment><comments>http://www.cppblog.com/tclh123/archive/2011/03/27/142812.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/tclh123/comments/commentRss/142812.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/tclh123/services/trackbacks/142812.html</trackback:ping><description><![CDATA[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=114&page=show_problem&problem=47

题目大意：判断 两个排列 的 最多 相同的相对位置（顺序）。

题目类型：简单dp，最长公共子序列，最长单增子序列。（注意串和序列的区别）

分析：解法一：把序列sort，然后就变成求它与原序列的最长公共子串问题了。
         
         解法二：按最长单增子序列做，最后变成求d的最大值。

代码：
                            另外，此题表述相当有问题。看看第二个样例就知道，靠，白白害我郁闷调了一晚上，擦。
            果断鄙视之。   
       <img src ="http://www.cppblog.com/tclh123/aggbug/142812.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/tclh123/" target="_blank">泳裤王子</a> 2011-03-27 22:35 <a href="http://www.cppblog.com/tclh123/archive/2011/03/27/142812.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>aha?</title><link>http://www.cppblog.com/tclh123/archive/2011/03/27/142802.html</link><dc:creator>泳裤王子</dc:creator><author>泳裤王子</author><pubDate>Sun, 27 Mar 2011 12:11:00 GMT</pubDate><guid>http://www.cppblog.com/tclh123/archive/2011/03/27/142802.html</guid><wfw:comment>http://www.cppblog.com/tclh123/comments/142802.html</wfw:comment><comments>http://www.cppblog.com/tclh123/archive/2011/03/27/142802.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/tclh123/comments/commentRss/142802.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/tclh123/services/trackbacks/142802.html</trackback:ping><description><![CDATA[ <img src ="http://www.cppblog.com/tclh123/aggbug/142802.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/tclh123/" target="_blank">泳裤王子</a> 2011-03-27 20:11 <a href="http://www.cppblog.com/tclh123/archive/2011/03/27/142802.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>