<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[zyc_7的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/zyc_7</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; zyc_7]]></copyright><item><title><![CDATA[最长递增自序列 python]]></title><link>https://blog.youkuaiyun.com/zyc_7/article/details/51625960</link><guid>https://blog.youkuaiyun.com/zyc_7/article/details/51625960</guid><author>zyc_7</author><pubDate>Fri, 10 Jun 2016 02:48:01 +0800</pubDate><description><![CDATA[最长递增自序列是一个用动态规划中的经典问题。<python>
    def get_max_increase_sequence(a):
        # dp[i] = max{dp[j] | 0<=j<i, a[i]<a[j] } + 1
        num=len(a)
        dp=[0]*num
        for i in xrange(num):]]></description><category></category></item></channel></rss>